./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:56:59,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:56:59,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 08:56:59,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:56:59,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:56:59,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:56:59,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:56:59,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:56:59,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:56:59,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:56:59,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:56:59,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:56:59,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:56:59,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:56:59,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:56:59,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:56:59,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:56:59,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:56:59,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:56:59,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:56:59,869 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:56:59,872 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:56:59,872 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:56:59,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:56:59,873 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:56:59,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:56:59,873 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:56:59,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:56:59,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:56:59,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:56:59,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:56:59,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:56:59,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:56:59,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:56:59,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:56:59,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:56:59,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:56:59,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:56:59,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:56:59,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:56:59,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:56:59,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:56:59,879 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-19 08:57:00,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:57:00,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:57:00,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:57:00,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:57:00,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:57:00,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-11-19 08:57:01,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:57:01,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:57:01,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-11-19 08:57:01,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e918a62/e9366a7365a046efb4860af20a0565a3/FLAG90df5970e [2024-11-19 08:57:02,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e918a62/e9366a7365a046efb4860af20a0565a3 [2024-11-19 08:57:02,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:57:02,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:57:02,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:02,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:57:02,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:57:02,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:02,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3ec97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02, skipping insertion in model container [2024-11-19 08:57:02,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:02,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:57:02,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,721 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,738 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,750 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:02,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:02,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:57:02,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:02,890 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:57:02,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02 WrapperNode [2024-11-19 08:57:02,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:02,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:02,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:57:02,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:57:02,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:02,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:02,985 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 805 [2024-11-19 08:57:02,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:02,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:57:02,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:57:02,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:57:03,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,074 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-19 08:57:03,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:57:03,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:57:03,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:57:03,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:57:03,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (1/1) ... [2024-11-19 08:57:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:03,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 08:57:03,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 08:57:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 08:57:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 08:57:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 08:57:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:57:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:57:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:57:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:57:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:57:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 08:57:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 08:57:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:57:03,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:57:03,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:57:03,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:57:03,458 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:03,504 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:04,905 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-19 08:57:04,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:57:04,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:57:04,945 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-19 08:57:04,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:04 BoogieIcfgContainer [2024-11-19 08:57:04,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:57:04,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:57:04,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:57:04,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:57:04,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:57:02" (1/3) ... [2024-11-19 08:57:04,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab6d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:04, skipping insertion in model container [2024-11-19 08:57:04,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:02" (2/3) ... [2024-11-19 08:57:04,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab6d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:04, skipping insertion in model container [2024-11-19 08:57:04,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:04" (3/3) ... [2024-11-19 08:57:04,954 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2024-11-19 08:57:04,969 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:57:04,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-19 08:57:05,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:57:05,036 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;@7ff2c087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:57:05,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-19 08:57:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:57:05,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:05,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:57:05,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 08:57:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54052853] [2024-11-19 08:57:05,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54052853] [2024-11-19 08:57:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54052853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:05,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:05,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:05,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609927529] [2024-11-19 08:57:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:05,316 INFO L87 Difference]: Start difference. First operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:05,997 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-19 08:57:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 08:57:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:06,018 INFO L225 Difference]: With dead ends: 680 [2024-11-19 08:57:06,019 INFO L226 Difference]: Without dead ends: 678 [2024-11-19 08:57:06,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:06,024 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 678 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:06,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 469 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:57:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-19 08:57:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2024-11-19 08:57:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 409 states have (on average 1.8533007334963325) internal successors, (758), 671 states have internal predecessors, (758), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 764 transitions. [2024-11-19 08:57:06,097 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 764 transitions. Word has length 5 [2024-11-19 08:57:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:06,097 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 764 transitions. [2024-11-19 08:57:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 764 transitions. [2024-11-19 08:57:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:57:06,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:06,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:57:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 08:57:06,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 08:57:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738156016] [2024-11-19 08:57:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738156016] [2024-11-19 08:57:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738156016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629362824] [2024-11-19 08:57:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:06,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:06,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:06,244 INFO L87 Difference]: Start difference. First operand 676 states and 764 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:06,724 INFO L93 Difference]: Finished difference Result 753 states and 847 transitions. [2024-11-19 08:57:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:06,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 08:57:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:06,728 INFO L225 Difference]: With dead ends: 753 [2024-11-19 08:57:06,729 INFO L226 Difference]: Without dead ends: 753 [2024-11-19 08:57:06,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:06,730 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 416 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:06,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 828 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:57:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-19 08:57:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 705. [2024-11-19 08:57:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 449 states have (on average 1.8396436525612472) internal successors, (826), 700 states have internal predecessors, (826), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 832 transitions. [2024-11-19 08:57:06,750 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 832 transitions. Word has length 5 [2024-11-19 08:57:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:06,750 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 832 transitions. [2024-11-19 08:57:06,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 832 transitions. [2024-11-19 08:57:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 08:57:06,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:06,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 08:57:06,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 08:57:06,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1423342697, now seen corresponding path program 1 times [2024-11-19 08:57:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438028331] [2024-11-19 08:57:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:06,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438028331] [2024-11-19 08:57:06,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438028331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:06,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043800426] [2024-11-19 08:57:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:06,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:06,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:06,802 INFO L87 Difference]: Start difference. First operand 705 states and 832 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:06,835 INFO L93 Difference]: Finished difference Result 1386 states and 1639 transitions. [2024-11-19 08:57:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 08:57:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:06,841 INFO L225 Difference]: With dead ends: 1386 [2024-11-19 08:57:06,842 INFO L226 Difference]: Without dead ends: 1386 [2024-11-19 08:57:06,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:06,847 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 721 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:06,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-19 08:57:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-19 08:57:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-19 08:57:06,870 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-19 08:57:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:06,871 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-19 08:57:06,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-19 08:57:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 08:57:06,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:06,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:06,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 08:57:06,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:06,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480742, now seen corresponding path program 1 times [2024-11-19 08:57:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338539571] [2024-11-19 08:57:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338539571] [2024-11-19 08:57:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338539571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27700932] [2024-11-19 08:57:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:06,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:06,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:06,994 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:07,535 INFO L93 Difference]: Finished difference Result 732 states and 886 transitions. [2024-11-19 08:57:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 08:57:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:07,538 INFO L225 Difference]: With dead ends: 732 [2024-11-19 08:57:07,539 INFO L226 Difference]: Without dead ends: 732 [2024-11-19 08:57:07,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:07,544 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 942 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:07,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 730 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-19 08:57:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 683. [2024-11-19 08:57:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 450 states have (on average 1.7866666666666666) internal successors, (804), 678 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 810 transitions. [2024-11-19 08:57:07,564 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 810 transitions. Word has length 15 [2024-11-19 08:57:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:07,564 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 810 transitions. [2024-11-19 08:57:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 810 transitions. [2024-11-19 08:57:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 08:57:07,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:07,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:07,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 08:57:07,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:07,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480743, now seen corresponding path program 1 times [2024-11-19 08:57:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650186383] [2024-11-19 08:57:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650186383] [2024-11-19 08:57:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650186383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:07,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575849815] [2024-11-19 08:57:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:07,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:07,674 INFO L87 Difference]: Start difference. First operand 683 states and 810 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:07,702 INFO L93 Difference]: Finished difference Result 608 states and 707 transitions. [2024-11-19 08:57:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 08:57:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:07,705 INFO L225 Difference]: With dead ends: 608 [2024-11-19 08:57:07,705 INFO L226 Difference]: Without dead ends: 608 [2024-11-19 08:57:07,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:07,707 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 61 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:07,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-19 08:57:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-19 08:57:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 387 states have (on average 1.8113695090439277) internal successors, (701), 603 states have internal predecessors, (701), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 707 transitions. [2024-11-19 08:57:07,721 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 707 transitions. Word has length 15 [2024-11-19 08:57:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:07,721 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 707 transitions. [2024-11-19 08:57:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 707 transitions. [2024-11-19 08:57:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 08:57:07,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:07,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 08:57:07,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash -889043613, now seen corresponding path program 1 times [2024-11-19 08:57:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:07,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163122024] [2024-11-19 08:57:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163122024] [2024-11-19 08:57:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163122024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323743354] [2024-11-19 08:57:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:07,797 INFO L87 Difference]: Start difference. First operand 608 states and 707 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:07,848 INFO L93 Difference]: Finished difference Result 590 states and 682 transitions. [2024-11-19 08:57:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-19 08:57:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:07,852 INFO L225 Difference]: With dead ends: 590 [2024-11-19 08:57:07,852 INFO L226 Difference]: Without dead ends: 590 [2024-11-19 08:57:07,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:07,853 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 41 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:07,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1712 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-19 08:57:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2024-11-19 08:57:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 373 states have (on average 1.804289544235925) internal successors, (673), 582 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 679 transitions. [2024-11-19 08:57:07,864 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 679 transitions. Word has length 17 [2024-11-19 08:57:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:07,864 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 679 transitions. [2024-11-19 08:57:07,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 679 transitions. [2024-11-19 08:57:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 08:57:07,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:07,865 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] [2024-11-19 08:57:07,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 08:57:07,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:07,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1279459759, now seen corresponding path program 1 times [2024-11-19 08:57:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640921725] [2024-11-19 08:57:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640921725] [2024-11-19 08:57:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640921725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:08,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537880635] [2024-11-19 08:57:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:08,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:08,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:08,045 INFO L87 Difference]: Start difference. First operand 587 states and 679 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:08,578 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-11-19 08:57:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 08:57:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:08,581 INFO L225 Difference]: With dead ends: 680 [2024-11-19 08:57:08,581 INFO L226 Difference]: Without dead ends: 680 [2024-11-19 08:57:08,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:08,582 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 417 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:08,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1011 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-19 08:57:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 583. [2024-11-19 08:57:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7935656836461127) internal successors, (669), 578 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 675 transitions. [2024-11-19 08:57:08,594 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 675 transitions. Word has length 31 [2024-11-19 08:57:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:08,594 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 675 transitions. [2024-11-19 08:57:08,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 675 transitions. [2024-11-19 08:57:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 08:57:08,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:08,596 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] [2024-11-19 08:57:08,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 08:57:08,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:08,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1848554501, now seen corresponding path program 1 times [2024-11-19 08:57:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373144721] [2024-11-19 08:57:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373144721] [2024-11-19 08:57:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373144721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:08,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497932708] [2024-11-19 08:57:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:08,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:08,695 INFO L87 Difference]: Start difference. First operand 583 states and 675 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:08,739 INFO L93 Difference]: Finished difference Result 583 states and 671 transitions. [2024-11-19 08:57:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:08,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-19 08:57:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:08,742 INFO L225 Difference]: With dead ends: 583 [2024-11-19 08:57:08,742 INFO L226 Difference]: Without dead ends: 583 [2024-11-19 08:57:08,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:08,743 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 21 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:08,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1694 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-19 08:57:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-11-19 08:57:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7828418230563003) internal successors, (665), 578 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 671 transitions. [2024-11-19 08:57:08,769 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 671 transitions. Word has length 65 [2024-11-19 08:57:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:08,769 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 671 transitions. [2024-11-19 08:57:08,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 671 transitions. [2024-11-19 08:57:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 08:57:08,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:08,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:08,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 08:57:08,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:08,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -516543407, now seen corresponding path program 1 times [2024-11-19 08:57:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009911274] [2024-11-19 08:57:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009911274] [2024-11-19 08:57:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009911274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:08,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:08,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:08,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135962735] [2024-11-19 08:57:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:08,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:08,910 INFO L87 Difference]: Start difference. First operand 583 states and 671 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:08,950 INFO L93 Difference]: Finished difference Result 679 states and 794 transitions. [2024-11-19 08:57:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-19 08:57:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:08,953 INFO L225 Difference]: With dead ends: 679 [2024-11-19 08:57:08,953 INFO L226 Difference]: Without dead ends: 679 [2024-11-19 08:57:08,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:08,954 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:08,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-19 08:57:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-11-19 08:57:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 469 states have (on average 1.6801705756929637) internal successors, (788), 674 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 794 transitions. [2024-11-19 08:57:08,966 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 794 transitions. Word has length 73 [2024-11-19 08:57:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:08,966 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 794 transitions. [2024-11-19 08:57:08,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 794 transitions. [2024-11-19 08:57:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 08:57:08,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:08,967 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] [2024-11-19 08:57:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 08:57:08,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 416038488, now seen corresponding path program 1 times [2024-11-19 08:57:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879951499] [2024-11-19 08:57:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879951499] [2024-11-19 08:57:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879951499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:09,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:57:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727326513] [2024-11-19 08:57:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:09,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:57:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:09,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:57:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:09,502 INFO L87 Difference]: Start difference. First operand 679 states and 794 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:10,291 INFO L93 Difference]: Finished difference Result 641 states and 756 transitions. [2024-11-19 08:57:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2024-11-19 08:57:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:10,295 INFO L225 Difference]: With dead ends: 641 [2024-11-19 08:57:10,295 INFO L226 Difference]: Without dead ends: 641 [2024-11-19 08:57:10,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:10,296 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 472 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:10,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 683 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:57:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-19 08:57:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 601. [2024-11-19 08:57:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 429 states have (on average 1.564102564102564) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-19 08:57:10,308 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 76 [2024-11-19 08:57:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-19 08:57:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-19 08:57:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 08:57:10,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:10,310 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] [2024-11-19 08:57:10,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 08:57:10,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:10,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 157004196, now seen corresponding path program 1 times [2024-11-19 08:57:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257568575] [2024-11-19 08:57:10,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:10,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:10,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257568575] [2024-11-19 08:57:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257568575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:10,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:10,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:10,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345929715] [2024-11-19 08:57:10,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:10,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:57:10,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:10,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:57:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:10,587 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:11,107 INFO L93 Difference]: Finished difference Result 600 states and 676 transitions. [2024-11-19 08:57:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-19 08:57:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:11,110 INFO L225 Difference]: With dead ends: 600 [2024-11-19 08:57:11,110 INFO L226 Difference]: Without dead ends: 600 [2024-11-19 08:57:11,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:11,111 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:11,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-19 08:57:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-19 08:57:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 429 states have (on average 1.5617715617715617) internal successors, (670), 595 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-19 08:57:11,122 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 81 [2024-11-19 08:57:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-19 08:57:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-19 08:57:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 08:57:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:11,124 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] [2024-11-19 08:57:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 08:57:11,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash 157004197, now seen corresponding path program 1 times [2024-11-19 08:57:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146755021] [2024-11-19 08:57:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146755021] [2024-11-19 08:57:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146755021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168189314] [2024-11-19 08:57:11,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:11,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:57:11,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:11,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:57:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:57:11,573 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:12,117 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2024-11-19 08:57:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-19 08:57:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:12,120 INFO L225 Difference]: With dead ends: 599 [2024-11-19 08:57:12,120 INFO L226 Difference]: Without dead ends: 599 [2024-11-19 08:57:12,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:12,121 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:12,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1515 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-19 08:57:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-11-19 08:57:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 594 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 675 transitions. [2024-11-19 08:57:12,134 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 675 transitions. Word has length 81 [2024-11-19 08:57:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:12,135 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 675 transitions. [2024-11-19 08:57:12,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 675 transitions. [2024-11-19 08:57:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:57:12,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:12,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] [2024-11-19 08:57:12,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 08:57:12,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 896889099, now seen corresponding path program 1 times [2024-11-19 08:57:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321329575] [2024-11-19 08:57:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321329575] [2024-11-19 08:57:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321329575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:12,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:57:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898770020] [2024-11-19 08:57:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:57:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:57:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:57:12,393 INFO L87 Difference]: Start difference. First operand 599 states and 675 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:12,945 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-19 08:57:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:57:12,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-19 08:57:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:12,950 INFO L225 Difference]: With dead ends: 611 [2024-11-19 08:57:12,951 INFO L226 Difference]: Without dead ends: 611 [2024-11-19 08:57:12,951 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 08:57:12,952 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 6 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:12,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2041 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:57:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-19 08:57:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2024-11-19 08:57:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 08:57:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 685 transitions. [2024-11-19 08:57:12,965 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 685 transitions. Word has length 89 [2024-11-19 08:57:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:12,965 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 685 transitions. [2024-11-19 08:57:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 685 transitions. [2024-11-19 08:57:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:57:12,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:12,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 08:57:12,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash 896889100, now seen corresponding path program 1 times [2024-11-19 08:57:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559035680] [2024-11-19 08:57:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559035680] [2024-11-19 08:57:13,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559035680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:13,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:13,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:57:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895915298] [2024-11-19 08:57:13,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:13,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:57:13,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:57:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:57:13,479 INFO L87 Difference]: Start difference. First operand 605 states and 685 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:14,092 INFO L93 Difference]: Finished difference Result 605 states and 684 transitions. [2024-11-19 08:57:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:57:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-19 08:57:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:14,095 INFO L225 Difference]: With dead ends: 605 [2024-11-19 08:57:14,096 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 08:57:14,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:57:14,097 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 1 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:14,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1950 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:57:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 08:57:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-19 08:57:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5588914549653579) internal successors, (675), 599 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 08:57:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-19 08:57:14,110 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 89 [2024-11-19 08:57:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:14,110 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-19 08:57:14,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-19 08:57:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 08:57:14,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:14,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:14,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 08:57:14,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:14,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -962114482, now seen corresponding path program 1 times [2024-11-19 08:57:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455028916] [2024-11-19 08:57:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455028916] [2024-11-19 08:57:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455028916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32510477] [2024-11-19 08:57:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:14,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:14,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:14,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:14,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 08:57:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:14,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 08:57:14,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:14,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:14,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:15,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:15,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:15,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:15,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:15,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:15,174 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 08:57:15,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 08:57:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32510477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:15,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-19 08:57:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104547368] [2024-11-19 08:57:15,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:15,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:57:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:57:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2024-11-19 08:57:15,222 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 14 states, 12 states have (on average 8.583333333333334) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:16,653 INFO L93 Difference]: Finished difference Result 604 states and 683 transitions. [2024-11-19 08:57:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:16,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.583333333333334) internal successors, (103), 13 states have internal predecessors, (103), 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 90 [2024-11-19 08:57:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:16,656 INFO L225 Difference]: With dead ends: 604 [2024-11-19 08:57:16,657 INFO L226 Difference]: Without dead ends: 604 [2024-11-19 08:57:16,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2024-11-19 08:57:16,659 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 479 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:16,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 2799 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:57:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-19 08:57:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-19 08:57:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 433 states have (on average 1.556581986143187) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 08:57:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-19 08:57:16,673 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 90 [2024-11-19 08:57:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:16,674 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-19 08:57:16,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.583333333333334) internal successors, (103), 13 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-19 08:57:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 08:57:16,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:16,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:16,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 08:57:16,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:16,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -962114481, now seen corresponding path program 1 times [2024-11-19 08:57:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:16,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693875671] [2024-11-19 08:57:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693875671] [2024-11-19 08:57:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693875671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848553034] [2024-11-19 08:57:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:17,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:17,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:17,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:17,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 08:57:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:17,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 08:57:17,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:17,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:17,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 08:57:17,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 08:57:17,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 08:57:18,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:57:18,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:18,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:18,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:18,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:18,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:57:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:18,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:18,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:57:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848553034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:18,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-19 08:57:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423078830] [2024-11-19 08:57:18,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:57:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:57:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-19 08:57:18,378 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:20,353 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-19 08:57:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:57:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-19 08:57:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:20,356 INFO L225 Difference]: With dead ends: 611 [2024-11-19 08:57:20,356 INFO L226 Difference]: Without dead ends: 611 [2024-11-19 08:57:20,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-19 08:57:20,357 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 494 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:20,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2819 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 08:57:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-19 08:57:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 602. [2024-11-19 08:57:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 432 states have (on average 1.5555555555555556) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-19 08:57:20,369 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 90 [2024-11-19 08:57:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:20,370 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-19 08:57:20,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.666666666666667) internal successors, (115), 18 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-19 08:57:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:57:20,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:20,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:20,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 08:57:20,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 08:57:20,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:20,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 232210623, now seen corresponding path program 1 times [2024-11-19 08:57:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48703642] [2024-11-19 08:57:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48703642] [2024-11-19 08:57:21,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48703642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:21,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:21,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 08:57:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980328131] [2024-11-19 08:57:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:21,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:57:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:57:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:57:21,139 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:22,234 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-19 08:57:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:57:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-19 08:57:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:22,238 INFO L225 Difference]: With dead ends: 615 [2024-11-19 08:57:22,238 INFO L226 Difference]: Without dead ends: 615 [2024-11-19 08:57:22,238 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 08:57:22,239 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 499 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:22,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3074 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-19 08:57:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2024-11-19 08:57:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.55) internal successors, (682), 604 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 689 transitions. [2024-11-19 08:57:22,250 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 689 transitions. Word has length 92 [2024-11-19 08:57:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 689 transitions. [2024-11-19 08:57:22,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 689 transitions. [2024-11-19 08:57:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:57:22,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:22,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:22,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 08:57:22,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash 232210624, now seen corresponding path program 1 times [2024-11-19 08:57:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:22,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342413850] [2024-11-19 08:57:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342413850] [2024-11-19 08:57:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342413850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 08:57:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006878218] [2024-11-19 08:57:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 08:57:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 08:57:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:57:22,890 INFO L87 Difference]: Start difference. First operand 611 states and 689 transitions. Second operand has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:24,164 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-19 08:57:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 08:57:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-19 08:57:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:24,166 INFO L225 Difference]: With dead ends: 614 [2024-11-19 08:57:24,166 INFO L226 Difference]: Without dead ends: 614 [2024-11-19 08:57:24,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 08:57:24,167 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 477 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:24,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 2393 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 08:57:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-19 08:57:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-19 08:57:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-19 08:57:24,178 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 92 [2024-11-19 08:57:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:24,178 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-19 08:57:24,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-19 08:57:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 08:57:24,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:24,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:24,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 08:57:24,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156324, now seen corresponding path program 1 times [2024-11-19 08:57:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984711685] [2024-11-19 08:57:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984711685] [2024-11-19 08:57:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984711685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:24,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749550631] [2024-11-19 08:57:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:24,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:24,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 08:57:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:24,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 08:57:24,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:25,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:25,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:25,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:25,156 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:25,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 08:57:25,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:25,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:25,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:25,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:25,346 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 08:57:25,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-19 08:57:25,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_879 (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~mem51#1.base| v_ArrVal_879))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-11-19 08:57:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749550631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:25,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:25,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2024-11-19 08:57:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208700402] [2024-11-19 08:57:25,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:25,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 08:57:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:25,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 08:57:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=275, Unknown=16, NotChecked=34, Total=380 [2024-11-19 08:57:25,357 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 17 states, 15 states have (on average 7.6) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:26,554 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-19 08:57:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:26,555 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.6) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-19 08:57:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:26,557 INFO L225 Difference]: With dead ends: 613 [2024-11-19 08:57:26,557 INFO L226 Difference]: Without dead ends: 613 [2024-11-19 08:57:26,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=528, Unknown=16, NotChecked=48, Total=702 [2024-11-19 08:57:26,559 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 475 mSDsluCounter, 3072 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:26,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 3396 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:57:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-19 08:57:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-19 08:57:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 440 states have (on average 1.5454545454545454) internal successors, (680), 603 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 687 transitions. [2024-11-19 08:57:26,572 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 687 transitions. Word has length 93 [2024-11-19 08:57:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:26,573 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 687 transitions. [2024-11-19 08:57:26,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.6) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 687 transitions. [2024-11-19 08:57:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 08:57:26,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:26,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:26,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 08:57:26,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:26,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156323, now seen corresponding path program 1 times [2024-11-19 08:57:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837895447] [2024-11-19 08:57:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837895447] [2024-11-19 08:57:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837895447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269147618] [2024-11-19 08:57:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:27,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:27,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:27,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:27,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 08:57:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:27,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 08:57:27,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:27,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:27,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:27,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 08:57:28,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:28,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:28,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:28,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:28,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:28,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:28,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:28,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:57:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:28,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:28,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1013 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1014) |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~mem53#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:57:28,231 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_1014 (Array Int Int)) (v_ArrVal_1013 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-19 08:57:28,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:57:28,317 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 84 treesize of output 88 [2024-11-19 08:57:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269147618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:28,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-19 08:57:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924214011] [2024-11-19 08:57:28,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 08:57:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 08:57:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=478, Unknown=2, NotChecked=90, Total=650 [2024-11-19 08:57:28,416 INFO L87 Difference]: Start difference. First operand 610 states and 687 transitions. Second operand has 21 states, 18 states have (on average 6.722222222222222) internal successors, (121), 21 states have internal predecessors, (121), 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 08:57:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:30,027 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2024-11-19 08:57:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:57:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.722222222222222) internal successors, (121), 21 states have internal predecessors, (121), 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 93 [2024-11-19 08:57:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:30,029 INFO L225 Difference]: With dead ends: 612 [2024-11-19 08:57:30,029 INFO L226 Difference]: Without dead ends: 612 [2024-11-19 08:57:30,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-11-19 08:57:30,031 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 471 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 3381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 3402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:30,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 3176 Invalid, 3402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3381 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 08:57:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-19 08:57:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2024-11-19 08:57:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-19 08:57:30,041 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 93 [2024-11-19 08:57:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-19 08:57:30,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.722222222222222) internal successors, (121), 21 states have internal predecessors, (121), 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 08:57:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-19 08:57:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:57:30,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:30,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:30,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 08:57:30,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:30,244 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026382, now seen corresponding path program 1 times [2024-11-19 08:57:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993848721] [2024-11-19 08:57:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993848721] [2024-11-19 08:57:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993848721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 08:57:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034087606] [2024-11-19 08:57:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 08:57:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:30,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 08:57:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 08:57:30,820 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:31,814 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-19 08:57:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-19 08:57:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:31,817 INFO L225 Difference]: With dead ends: 616 [2024-11-19 08:57:31,817 INFO L226 Difference]: Without dead ends: 616 [2024-11-19 08:57:31,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:57:31,818 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 482 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:31,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2483 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:57:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-19 08:57:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2024-11-19 08:57:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5417607223476297) internal successors, (683), 605 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 690 transitions. [2024-11-19 08:57:31,830 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 690 transitions. Word has length 95 [2024-11-19 08:57:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:31,830 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 690 transitions. [2024-11-19 08:57:31,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 690 transitions. [2024-11-19 08:57:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:57:31,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:31,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:31,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 08:57:31,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:31,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026381, now seen corresponding path program 1 times [2024-11-19 08:57:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:31,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506381179] [2024-11-19 08:57:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506381179] [2024-11-19 08:57:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506381179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:32,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 08:57:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839447848] [2024-11-19 08:57:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:32,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 08:57:32,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 08:57:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 08:57:32,619 INFO L87 Difference]: Start difference. First operand 612 states and 690 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:33,744 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-19 08:57:33,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:57:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-19 08:57:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:33,747 INFO L225 Difference]: With dead ends: 615 [2024-11-19 08:57:33,747 INFO L226 Difference]: Without dead ends: 615 [2024-11-19 08:57:33,747 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 08:57:33,748 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 497 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:33,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1925 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-19 08:57:33,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-19 08:57:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5395033860045146) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-19 08:57:33,757 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 95 [2024-11-19 08:57:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:33,757 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-19 08:57:33,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-19 08:57:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 08:57:33,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:33,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:33,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 08:57:33,759 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:33,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080267, now seen corresponding path program 1 times [2024-11-19 08:57:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712743748] [2024-11-19 08:57:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:34,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:34,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712743748] [2024-11-19 08:57:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712743748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481049322] [2024-11-19 08:57:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:34,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:34,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:34,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 08:57:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:34,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 08:57:34,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:34,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:34,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:34,694 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:34,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:34,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:34,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:34,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:34,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:34,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:34,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1293) |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 08:57:34,817 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 (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_1293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 08:57:34,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1292))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1293)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:57:34,893 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 08:57:34,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-19 08:57:34,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1293 (Array Int Int)) (v_ArrVal_1292 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_1296))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1292)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1293)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-19 08:57:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481049322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:34,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2024-11-19 08:57:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151683079] [2024-11-19 08:57:34,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:34,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:57:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:57:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=285, Unknown=7, NotChecked=148, Total=506 [2024-11-19 08:57:34,903 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 18 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:36,277 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-19 08:57:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:57:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 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 96 [2024-11-19 08:57:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:36,279 INFO L225 Difference]: With dead ends: 614 [2024-11-19 08:57:36,280 INFO L226 Difference]: Without dead ends: 614 [2024-11-19 08:57:36,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=580, Unknown=7, NotChecked=212, Total=930 [2024-11-19 08:57:36,281 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 489 mSDsluCounter, 3346 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:36,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3669 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 08:57:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-19 08:57:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-19 08:57:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 443 states have (on average 1.5372460496613995) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-19 08:57:36,296 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 96 [2024-11-19 08:57:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:36,297 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-19 08:57:36,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.0625) internal successors, (113), 17 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-19 08:57:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 08:57:36,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:36,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:36,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 08:57:36,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 08:57:36,499 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080266, now seen corresponding path program 1 times [2024-11-19 08:57:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719815230] [2024-11-19 08:57:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719815230] [2024-11-19 08:57:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719815230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399933102] [2024-11-19 08:57:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:37,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:37,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 08:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:37,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 08:57:37,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:37,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:37,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:37,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:37,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:37,754 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 31 treesize of output 32 [2024-11-19 08:57:37,806 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-19 08:57:37,806 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 69 treesize of output 41 [2024-11-19 08:57:37,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:37,930 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 08:57:37,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-19 08:57:37,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 08:57:37,942 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 51 treesize of output 32 [2024-11-19 08:57:37,985 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 08:57:37,988 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 34 treesize of output 16 [2024-11-19 08:57:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:38,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:38,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:57:38,195 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 112 treesize of output 116 [2024-11-19 08:57:38,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|) (+ 16 |c_ULTIMATE.start_main_#t~mem53#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1440 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1440))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ 9 (select (select (store .cse0 .cse2 v_ArrVal_1444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1440 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1440))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< (select (select (store .cse3 .cse2 v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 9 |c_ULTIMATE.start_main_#t~mem53#1.offset|))))) (or (forall ((v_ArrVal_1443 (Array Int Int))) (= (select (select (store .cse4 .cse2 v_ArrVal_1443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem53#1.base|)) (and (forall ((v_ArrVal_1440 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)) (forall ((v_ArrVal_1440 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1440))) (or (forall ((v_ArrVal_1444 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse5 .cse2 v_ArrVal_1444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))))))) is different from false [2024-11-19 08:57:38,318 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 1162 treesize of output 1102 [2024-11-19 08:57:38,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 666 treesize of output 658 [2024-11-19 08:57:38,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 658 treesize of output 650 [2024-11-19 08:57:38,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 646 [2024-11-19 08:57:38,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 638 [2024-11-19 08:57:38,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 630 [2024-11-19 08:57:38,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 630 treesize of output 622 [2024-11-19 08:57:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 622 treesize of output 614 [2024-11-19 08:57:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399933102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:38,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-19 08:57:38,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160934408] [2024-11-19 08:57:38,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:38,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 08:57:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 08:57:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=705, Unknown=8, NotChecked=54, Total=870 [2024-11-19 08:57:38,553 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 24 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 24 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:40,225 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-19 08:57:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:57:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 24 states have internal predecessors, (127), 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 96 [2024-11-19 08:57:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:40,228 INFO L225 Difference]: With dead ends: 613 [2024-11-19 08:57:40,228 INFO L226 Difference]: Without dead ends: 613 [2024-11-19 08:57:40,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1072, Unknown=9, NotChecked=68, Total=1332 [2024-11-19 08:57:40,229 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 492 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:40,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 3008 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 08:57:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-19 08:57:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 598. [2024-11-19 08:57:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 432 states have (on average 1.5462962962962963) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-19 08:57:40,238 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 96 [2024-11-19 08:57:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:40,239 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-19 08:57:40,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 24 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-19 08:57:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:57:40,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:40,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:40,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 08:57:40,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:40,441 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945286, now seen corresponding path program 1 times [2024-11-19 08:57:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501486785] [2024-11-19 08:57:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:41,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501486785] [2024-11-19 08:57:41,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501486785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:41,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:41,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 08:57:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174705457] [2024-11-19 08:57:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:41,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:57:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:57:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 08:57:41,067 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:42,143 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-19 08:57:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:57:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-19 08:57:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:42,145 INFO L225 Difference]: With dead ends: 617 [2024-11-19 08:57:42,145 INFO L226 Difference]: Without dead ends: 617 [2024-11-19 08:57:42,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 08:57:42,146 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 499 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:42,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 3090 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:57:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-19 08:57:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-19 08:57:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-19 08:57:42,159 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 98 [2024-11-19 08:57:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:42,160 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-19 08:57:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-19 08:57:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:57:42,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:42,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 08:57:42,162 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945287, now seen corresponding path program 1 times [2024-11-19 08:57:42,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:42,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068145708] [2024-11-19 08:57:42,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068145708] [2024-11-19 08:57:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068145708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 08:57:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510295425] [2024-11-19 08:57:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 08:57:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 08:57:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:57:43,031 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:44,511 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-19 08:57:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 08:57:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-19 08:57:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:44,513 INFO L225 Difference]: With dead ends: 616 [2024-11-19 08:57:44,513 INFO L226 Difference]: Without dead ends: 616 [2024-11-19 08:57:44,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-19 08:57:44,514 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 497 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:44,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2569 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 08:57:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-19 08:57:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-19 08:57:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.531390134529148) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-19 08:57:44,524 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 98 [2024-11-19 08:57:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:44,525 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-19 08:57:44,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-19 08:57:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 08:57:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:44,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 08:57:44,526 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267811, now seen corresponding path program 1 times [2024-11-19 08:57:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578485412] [2024-11-19 08:57:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578485412] [2024-11-19 08:57:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578485412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538454342] [2024-11-19 08:57:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:45,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:45,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:45,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 08:57:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:45,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 08:57:45,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:45,448 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:45,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:45,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:45,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:45,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:45,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:45,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:45,625 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:45,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:45,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:45,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:45,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:45,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:45,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1745) |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 08:57:45,739 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:57:45,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (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~mem53#1.base| v_ArrVal_1743))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:57:45,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1743))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:57:45,832 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-19 08:57:45,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-19 08:57:45,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#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~mem51#1.base| v_ArrVal_1748))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1743)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-19 08:57:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538454342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:45,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:45,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2024-11-19 08:57:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353616234] [2024-11-19 08:57:45,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:57:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:57:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=461, Unknown=17, NotChecked=240, Total=812 [2024-11-19 08:57:45,846 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 22 states have internal predecessors, (125), 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 08:57:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:47,050 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-19 08:57:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:57:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 22 states have internal predecessors, (125), 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 99 [2024-11-19 08:57:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:47,052 INFO L225 Difference]: With dead ends: 615 [2024-11-19 08:57:47,052 INFO L226 Difference]: Without dead ends: 615 [2024-11-19 08:57:47,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=880, Unknown=18, NotChecked=330, Total=1406 [2024-11-19 08:57:47,053 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 489 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:47,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3362 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:57:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-19 08:57:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-19 08:57:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 446 states have (on average 1.5291479820627802) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-19 08:57:47,061 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 99 [2024-11-19 08:57:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-19 08:57:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 22 states have internal predecessors, (125), 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 08:57:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-19 08:57:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 08:57:47,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:47,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:47,082 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 08:57:47,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:47,268 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267812, now seen corresponding path program 1 times [2024-11-19 08:57:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570907160] [2024-11-19 08:57:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570907160] [2024-11-19 08:57:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570907160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875796175] [2024-11-19 08:57:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:48,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:48,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 08:57:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:48,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 08:57:48,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:48,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 08:57:48,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:48,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:48,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:48,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 08:57:48,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 08:57:48,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:57:48,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:48,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:48,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:48,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:48,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:48,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:48,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:48,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:48,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:48,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:48,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 08:57:48,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:57:48,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:48,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:57:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:48,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:48,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1911 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1911) |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~mem55#1.base| v_ArrVal_1912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:57:48,811 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_1911 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-19 08:57:48,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1910))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 24 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1909) .cse0 v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1909) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1910) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-19 08:57:48,902 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1907 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1907))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1908) .cse0 v_ArrVal_1909) (select (select (store .cse1 .cse0 v_ArrVal_1910) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1911))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1907 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1907))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1910))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1908) .cse3 v_ArrVal_1909) .cse4 v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 08:57:49,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1918))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1907))) (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~mem51#1.base| v_ArrVal_1917) .cse0 v_ArrVal_1908) .cse1 v_ArrVal_1909) (select (select (store .cse2 .cse1 v_ArrVal_1910) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1911))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1911 (Array Int Int)) (v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1908 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1907 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1918))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1907))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1910))) (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~mem51#1.base| v_ArrVal_1917) .cse5 v_ArrVal_1908) .cse6 v_ArrVal_1909) .cse7 v_ArrVal_1911) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-19 08:57:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875796175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:49,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-11-19 08:57:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875871966] [2024-11-19 08:57:49,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:57:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:57:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=446, Unknown=23, NotChecked=240, Total=812 [2024-11-19 08:57:49,314 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:51,131 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-19 08:57:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:57:51,131 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 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 99 [2024-11-19 08:57:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:51,133 INFO L225 Difference]: With dead ends: 614 [2024-11-19 08:57:51,133 INFO L226 Difference]: Without dead ends: 614 [2024-11-19 08:57:51,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=758, Unknown=23, NotChecked=310, Total=1260 [2024-11-19 08:57:51,133 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:51,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3033 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 08:57:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-19 08:57:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2024-11-19 08:57:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 432 states have (on average 1.5416666666666667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 08:57:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-19 08:57:51,140 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 99 [2024-11-19 08:57:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:51,140 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-19 08:57:51,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:57:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-19 08:57:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 08:57:51,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:51,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:51,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:51,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 08:57:51,346 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:51,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -490544312, now seen corresponding path program 1 times [2024-11-19 08:57:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633709892] [2024-11-19 08:57:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633709892] [2024-11-19 08:57:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633709892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 08:57:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141995726] [2024-11-19 08:57:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:57:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:57:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 08:57:52,086 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:53,052 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-19 08:57:53,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:57:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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 102 [2024-11-19 08:57:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:53,055 INFO L225 Difference]: With dead ends: 619 [2024-11-19 08:57:53,055 INFO L226 Difference]: Without dead ends: 619 [2024-11-19 08:57:53,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-19 08:57:53,055 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 502 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:53,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2464 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:57:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-19 08:57:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-19 08:57:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5244444444444445) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-19 08:57:53,063 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 102 [2024-11-19 08:57:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:53,063 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-19 08:57:53,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-19 08:57:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 08:57:53,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:53,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:53,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 08:57:53,065 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:53,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -490544311, now seen corresponding path program 1 times [2024-11-19 08:57:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021466962] [2024-11-19 08:57:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:54,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:54,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021466962] [2024-11-19 08:57:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021466962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:54,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 08:57:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025128701] [2024-11-19 08:57:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:57:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:57:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 08:57:54,074 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:55,940 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-19 08:57:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:57:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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 102 [2024-11-19 08:57:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:55,942 INFO L225 Difference]: With dead ends: 618 [2024-11-19 08:57:55,943 INFO L226 Difference]: Without dead ends: 618 [2024-11-19 08:57:55,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-19 08:57:55,944 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 480 mSDsluCounter, 3047 mSDsCounter, 0 mSdLazyCounter, 3686 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 3702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:55,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 3369 Invalid, 3702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3686 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 08:57:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-19 08:57:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-19 08:57:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5222222222222221) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-19 08:57:55,950 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 102 [2024-11-19 08:57:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:55,951 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-19 08:57:55,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-19 08:57:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 08:57:55,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:55,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 08:57:55,953 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492837, now seen corresponding path program 1 times [2024-11-19 08:57:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364380086] [2024-11-19 08:57:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:57:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364380086] [2024-11-19 08:57:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364380086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547691432] [2024-11-19 08:57:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:56,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:56,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:56,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:57:56,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 08:57:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:57,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 08:57:57,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:57,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:57:57,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:57:57,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:57:57,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:57,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:57,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:57,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:57,212 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:57,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:57,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:57,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:57,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:57:57,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 08:57:57,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 08:57:57,323 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 08:57:57,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 08:57:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:57:57,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:57:57,998 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-19 08:57:57,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-19 08:57:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547691432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:57:58,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:57:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 21 [2024-11-19 08:57:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133196602] [2024-11-19 08:57:58,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:57:58,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:57:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:57:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:57:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=859, Unknown=49, NotChecked=0, Total=1056 [2024-11-19 08:57:58,132 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 22 states, 20 states have (on average 6.2) internal successors, (124), 21 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:59,217 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-19 08:57:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 08:57:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 21 states have internal predecessors, (124), 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 103 [2024-11-19 08:57:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:59,219 INFO L225 Difference]: With dead ends: 617 [2024-11-19 08:57:59,219 INFO L226 Difference]: Without dead ends: 617 [2024-11-19 08:57:59,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=1487, Unknown=49, NotChecked=0, Total=1806 [2024-11-19 08:57:59,220 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 487 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:59,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2788 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:57:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-19 08:57:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-19 08:57:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 450 states have (on average 1.52) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 08:57:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-19 08:57:59,227 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 103 [2024-11-19 08:57:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:59,228 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-19 08:57:59,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.2) internal successors, (124), 21 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:57:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-19 08:57:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 08:57:59,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:59,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:59,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 08:57:59,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:57:59,434 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-19 08:57:59,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:59,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492838, now seen corresponding path program 1 times [2024-11-19 08:57:59,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:57:59,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651731014] [2024-11-19 08:57:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:57:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651731014] [2024-11-19 08:58:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651731014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558671270] [2024-11-19 08:58:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:00,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:00,630 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:58:00,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 08:58:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:00,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 08:58:00,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 08:58:00,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:00,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:58:00,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 08:58:00,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:58:01,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 08:58:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:58:01,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 08:58:01,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:58:01,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 08:58:01,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:58:01,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 08:58:01,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:58:01,352 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 08:58:01,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:58:01,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:01,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 08:58:01,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 08:58:01,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-19 08:58:01,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 08:58:01,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:58:01,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 08:58:01,458 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:01,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:58:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:01,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:01,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2432) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)) (forall ((v_ArrVal_2436 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2433))) (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~mem55#1.base| v_ArrVal_2432) .cse1 v_ArrVal_2435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2436) (select (select (store .cse2 .cse1 v_ArrVal_2434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-19 08:58:01,814 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2432) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (forall ((v_ArrVal_2436 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2433))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2432) .cse2 v_ArrVal_2435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2436) (select (select (store .cse3 .cse2 v_ArrVal_2434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-19 08:58:01,995 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2430))) (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_2431) .cse1 v_ArrVal_2432) (select (select (store .cse2 .cse1 v_ArrVal_2433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2435))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int)) (v_ArrVal_2430 (Array Int Int))) (or (forall ((v_ArrVal_2436 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2430))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2433))) (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_2431) .cse4 v_ArrVal_2432) .cse5 v_ArrVal_2435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2436) (select (select (store .cse6 .cse5 v_ArrVal_2434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false