./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:15:03,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:15:03,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:15:03,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:15:03,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:15:03,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:15:03,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:15:03,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:15:03,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:15:03,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:15:03,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:15:03,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:15:03,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:15:03,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:15:03,864 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:15:03,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:15:03,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:15:03,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:15:03,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:15:03,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:15:03,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:15:03,866 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:15:03,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:15:03,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:15:03,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:15:03,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:15:03,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:15:03,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:15:03,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:15:03,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:15:03,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:15:03,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:15:03,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:15:03,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:15:03,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:15:03,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:15:03,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:15:03,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:15:03,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:15:03,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:15:03,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:15:03,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:15:03,880 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-11-22 21:15:04,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:15:04,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:15:04,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:15:04,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:15:04,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:15:04,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-22 21:15:05,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:15:05,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:15:05,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-11-22 21:15:05,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabf56c64/de3623314356419fa0ee53f3999396a8/FLAG14acabf90 [2024-11-22 21:15:05,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabf56c64/de3623314356419fa0ee53f3999396a8 [2024-11-22 21:15:05,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:15:05,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:15:05,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:15:05,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:15:05,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:15:05,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:15:05" (1/1) ... [2024-11-22 21:15:05,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e5e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:05, skipping insertion in model container [2024-11-22 21:15:05,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:15:05" (1/1) ... [2024-11-22 21:15:06,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:15:06,460 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-22 21:15:06,500 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-22 21:15:06,506 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-22 21:15:06,513 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-22 21:15:06,524 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-22 21:15:06,563 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-22 21:15:06,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:15:06,568 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-22 21:15:06,572 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-22 21:15:06,597 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-22 21:15:06,598 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-22 21:15:06,599 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:15:06,600 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-22 21:15:06,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:15:06,634 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:15:06,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:15:06,797 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:15:06,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06 WrapperNode [2024-11-22 21:15:06,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:15:06,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:15:06,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:15:06,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:15:06,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:06,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:06,975 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2052 [2024-11-22 21:15:06,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:15:06,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:15:06,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:15:06,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:15:06,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:06,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,133 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-22 21:15:07,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:15:07,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:15:07,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:15:07,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:15:07,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (1/1) ... [2024-11-22 21:15:07,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:15:07,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:07,282 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-22 21:15:07,289 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-22 21:15:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 21:15:07,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 21:15:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:15:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:15:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 21:15:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 21:15:07,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 21:15:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:15:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:15:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 21:15:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 21:15:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 21:15:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 21:15:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 21:15:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 21:15:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 21:15:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:15:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:15:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:15:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 21:15:07,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:15:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:15:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:15:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 21:15:07,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:15:07,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:15:07,563 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:15:07,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:15:07,586 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:15:07,618 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:15:07,639 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:15:10,339 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-22 21:15:10,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:15:10,384 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:15:10,385 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-22 21:15:10,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:15:10 BoogieIcfgContainer [2024-11-22 21:15:10,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:15:10,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:15:10,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:15:10,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:15:10,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:15:05" (1/3) ... [2024-11-22 21:15:10,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c290ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:15:10, skipping insertion in model container [2024-11-22 21:15:10,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:15:06" (2/3) ... [2024-11-22 21:15:10,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c290ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:15:10, skipping insertion in model container [2024-11-22 21:15:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:15:10" (3/3) ... [2024-11-22 21:15:10,394 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-11-22 21:15:10,410 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:15:10,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-22 21:15:10,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:15:10,500 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;@4cfd1f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:15:10,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-22 21:15:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:15:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 21:15:10,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:10,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:15:10,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:10,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-22 21:15:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134441123] [2024-11-22 21:15:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:10,684 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-22 21:15:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134441123] [2024-11-22 21:15:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134441123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:15:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979654100] [2024-11-22 21:15:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 21:15:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 21:15:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:15:10,722 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:10,813 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-22 21:15:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 21:15:10,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 21:15:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:10,839 INFO L225 Difference]: With dead ends: 1718 [2024-11-22 21:15:10,839 INFO L226 Difference]: Without dead ends: 1716 [2024-11-22 21:15:10,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 21:15:10,844 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:10,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-22 21:15:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-22 21:15:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-22 21:15:10,965 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-22 21:15:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:10,965 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-22 21:15:10,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-22 21:15:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 21:15:10,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:10,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:15:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:15:10,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-22 21:15:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825355672] [2024-11-22 21:15:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:11,080 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-22 21:15:11,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825355672] [2024-11-22 21:15:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825355672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:11,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:11,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:15:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328458409] [2024-11-22 21:15:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:11,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:15:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:15:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:15:11,086 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 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-22 21:15:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:12,254 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-22 21:15:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:15:12,254 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-22 21:15:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:12,263 INFO L225 Difference]: With dead ends: 1945 [2024-11-22 21:15:12,263 INFO L226 Difference]: Without dead ends: 1945 [2024-11-22 21:15:12,265 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-22 21:15:12,266 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:12,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 21:15:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-22 21:15:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-22 21:15:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-22 21:15:12,314 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-22 21:15:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-22 21:15:12,316 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-22 21:15:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-22 21:15:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 21:15:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:12,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:15:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:15:12,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-22 21:15:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480178922] [2024-11-22 21:15:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:12,454 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-22 21:15:12,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480178922] [2024-11-22 21:15:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480178922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:15:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815777537] [2024-11-22 21:15:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:15:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:15:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:15:12,458 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 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-22 21:15:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:13,694 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-22 21:15:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:15:13,695 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-22 21:15:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:13,705 INFO L225 Difference]: With dead ends: 2361 [2024-11-22 21:15:13,705 INFO L226 Difference]: Without dead ends: 2361 [2024-11-22 21:15:13,708 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-22 21:15:13,709 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:13,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:15:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-22 21:15:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-22 21:15:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-22 21:15:13,766 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-22 21:15:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-22 21:15:13,766 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-22 21:15:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-22 21:15:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 21:15:13,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:13,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:15:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:15:13,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1957056365, now seen corresponding path program 1 times [2024-11-22 21:15:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:13,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191450098] [2024-11-22 21:15:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:13,813 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-22 21:15:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191450098] [2024-11-22 21:15:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191450098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:15:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365422683] [2024-11-22 21:15:13,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:13,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:15:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:15:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:15:13,815 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 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-22 21:15:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:13,895 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-22 21:15:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:15:13,896 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-22 21:15:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:13,910 INFO L225 Difference]: With dead ends: 3755 [2024-11-22 21:15:13,911 INFO L226 Difference]: Without dead ends: 3755 [2024-11-22 21:15:13,911 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-22 21:15:13,912 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:13,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-22 21:15:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-22 21:15:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-22 21:15:13,971 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-22 21:15:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-22 21:15:13,971 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-22 21:15:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-22 21:15:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 21:15:13,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:13,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:13,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:15:13,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:13,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:13,973 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-22 21:15:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792126130] [2024-11-22 21:15:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:14,059 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-22 21:15:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792126130] [2024-11-22 21:15:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792126130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:15:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133254206] [2024-11-22 21:15:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:15:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:15:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:15:14,064 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:15,280 INFO L93 Difference]: Finished difference Result 1915 states and 2413 transitions. [2024-11-22 21:15:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:15:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 21:15:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:15,287 INFO L225 Difference]: With dead ends: 1915 [2024-11-22 21:15:15,288 INFO L226 Difference]: Without dead ends: 1915 [2024-11-22 21:15:15,291 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-22 21:15:15,292 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 2005 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:15,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 2176 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 21:15:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-22 21:15:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1866. [2024-11-22 21:15:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1280 states have (on average 1.80703125) internal successors, (2313), 1856 states have internal predecessors, (2313), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2337 transitions. [2024-11-22 21:15:15,331 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2337 transitions. Word has length 11 [2024-11-22 21:15:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2337 transitions. [2024-11-22 21:15:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2337 transitions. [2024-11-22 21:15:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 21:15:15,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:15,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:15:15,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -408167559, now seen corresponding path program 1 times [2024-11-22 21:15:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198462180] [2024-11-22 21:15:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:15,414 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-22 21:15:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198462180] [2024-11-22 21:15:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198462180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:15,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:15,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:15:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516361615] [2024-11-22 21:15:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:15:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:15:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:15:15,417 INFO L87 Difference]: Start difference. First operand 1866 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:15,448 INFO L93 Difference]: Finished difference Result 1791 states and 2234 transitions. [2024-11-22 21:15:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:15:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 21:15:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:15,455 INFO L225 Difference]: With dead ends: 1791 [2024-11-22 21:15:15,455 INFO L226 Difference]: Without dead ends: 1791 [2024-11-22 21:15:15,456 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-22 21:15:15,457 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 61 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3419 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-22 21:15:15,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-22 21:15:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-22 21:15:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1217 states have (on average 1.8159408381265407) internal successors, (2210), 1781 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2234 transitions. [2024-11-22 21:15:15,494 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2234 transitions. Word has length 11 [2024-11-22 21:15:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2234 transitions. [2024-11-22 21:15:15,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2234 transitions. [2024-11-22 21:15:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 21:15:15,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:15,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:15:15,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1406843659, now seen corresponding path program 1 times [2024-11-22 21:15:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712540526] [2024-11-22 21:15:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:15,565 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-22 21:15:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712540526] [2024-11-22 21:15:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712540526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:15,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:15:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504453724] [2024-11-22 21:15:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:15:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:15,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:15:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:15:15,568 INFO L87 Difference]: Start difference. First operand 1791 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:15,634 INFO L93 Difference]: Finished difference Result 1776 states and 2212 transitions. [2024-11-22 21:15:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:15:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 21:15:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:15,641 INFO L225 Difference]: With dead ends: 1776 [2024-11-22 21:15:15,641 INFO L226 Difference]: Without dead ends: 1776 [2024-11-22 21:15:15,641 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-22 21:15:15,642 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 45 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:15,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5071 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-22 21:15:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-22 21:15:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-22 21:15:15,674 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 13 [2024-11-22 21:15:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:15,674 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-22 21:15:15,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-22 21:15:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 21:15:15,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:15,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] [2024-11-22 21:15:15,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:15:15,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:15,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1340702493, now seen corresponding path program 1 times [2024-11-22 21:15:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040702884] [2024-11-22 21:15:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:15,832 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-22 21:15:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040702884] [2024-11-22 21:15:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040702884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:15,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:15:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575620188] [2024-11-22 21:15:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:15:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:15:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:15:15,836 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:17,120 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-22 21:15:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:15:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 21:15:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:17,128 INFO L225 Difference]: With dead ends: 2296 [2024-11-22 21:15:17,128 INFO L226 Difference]: Without dead ends: 2296 [2024-11-22 21:15:17,128 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-22 21:15:17,129 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:17,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:15:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-22 21:15:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-22 21:15:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-22 21:15:17,175 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-22 21:15:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:17,175 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-22 21:15:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-22 21:15:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-22 21:15:17,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:17,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:17,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:15:17,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1878905961, now seen corresponding path program 1 times [2024-11-22 21:15:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093850434] [2024-11-22 21:15:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:17,284 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-22 21:15:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093850434] [2024-11-22 21:15:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093850434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:17,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:17,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:15:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125115267] [2024-11-22 21:15:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:15:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:15:17,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:15:17,288 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:17,348 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-22 21:15:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:15:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-22 21:15:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:17,354 INFO L225 Difference]: With dead ends: 1766 [2024-11-22 21:15:17,354 INFO L226 Difference]: Without dead ends: 1766 [2024-11-22 21:15:17,354 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-22 21:15:17,356 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 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-22 21:15:17,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-22 21:15:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-22 21:15:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-22 21:15:17,387 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-22 21:15:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:17,388 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-22 21:15:17,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-22 21:15:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 21:15:17,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:17,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:17,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:15:17,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:17,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1294710755, now seen corresponding path program 1 times [2024-11-22 21:15:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882316781] [2024-11-22 21:15:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:17,509 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-22 21:15:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882316781] [2024-11-22 21:15:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882316781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:15:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751575525] [2024-11-22 21:15:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:15:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:15:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:15:17,512 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:17,556 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-22 21:15:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:15:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-22 21:15:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:17,565 INFO L225 Difference]: With dead ends: 1858 [2024-11-22 21:15:17,565 INFO L226 Difference]: Without dead ends: 1858 [2024-11-22 21:15:17,566 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-22 21:15:17,566 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:17,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:15:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-22 21:15:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-22 21:15:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-22 21:15:17,595 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-22 21:15:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:17,596 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-22 21:15:17,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-22 21:15:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-22 21:15:17,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:17,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:15:17,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1814650898, now seen corresponding path program 1 times [2024-11-22 21:15:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689497521] [2024-11-22 21:15:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:18,163 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-22 21:15:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689497521] [2024-11-22 21:15:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689497521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:18,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:15:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378894471] [2024-11-22 21:15:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:15:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:15:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:15:18,165 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:19,445 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-22 21:15:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:15:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-22 21:15:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:19,451 INFO L225 Difference]: With dead ends: 1774 [2024-11-22 21:15:19,451 INFO L226 Difference]: Without dead ends: 1774 [2024-11-22 21:15:19,452 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-22 21:15:19,452 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1535 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:19,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1620 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:15:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-22 21:15:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-22 21:15:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-22 21:15:19,480 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-22 21:15:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:19,481 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-22 21:15:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-22 21:15:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 21:15:19,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:19,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:15:19,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -702590666, now seen corresponding path program 1 times [2024-11-22 21:15:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:19,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028735512] [2024-11-22 21:15:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:19,774 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-22 21:15:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028735512] [2024-11-22 21:15:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028735512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:15:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667102371] [2024-11-22 21:15:19,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:15:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:15:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:15:19,777 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:20,770 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-22 21:15:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:15:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-22 21:15:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:20,775 INFO L225 Difference]: With dead ends: 1500 [2024-11-22 21:15:20,776 INFO L226 Difference]: Without dead ends: 1500 [2024-11-22 21:15:20,776 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-22 21:15:20,777 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:20,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 21:15:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-22 21:15:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-22 21:15:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-22 21:15:20,799 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-22 21:15:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-22 21:15:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-22 21:15:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 21:15:20,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:20,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:15:20,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash -702590665, now seen corresponding path program 1 times [2024-11-22 21:15:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856355816] [2024-11-22 21:15:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:21,261 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-22 21:15:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856355816] [2024-11-22 21:15:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856355816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:21,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:15:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38862134] [2024-11-22 21:15:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:15:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:15:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:15:21,266 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:22,324 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-22 21:15:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:15:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-22 21:15:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:22,329 INFO L225 Difference]: With dead ends: 1499 [2024-11-22 21:15:22,329 INFO L226 Difference]: Without dead ends: 1499 [2024-11-22 21:15:22,330 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-22 21:15:22,330 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:22,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 21:15:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-22 21:15:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-22 21:15:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-22 21:15:22,352 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-22 21:15:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:22,352 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-22 21:15:22,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:15:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-22 21:15:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 21:15:22,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:22,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:22,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:15:22,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 545873214, now seen corresponding path program 1 times [2024-11-22 21:15:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960248559] [2024-11-22 21:15:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:22,867 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-22 21:15:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960248559] [2024-11-22 21:15:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960248559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:15:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622525493] [2024-11-22 21:15:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:22,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:15:22,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:22,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:15:22,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:15:22,870 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:24,103 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-22 21:15:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:15:24,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-22 21:15:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:24,110 INFO L225 Difference]: With dead ends: 1506 [2024-11-22 21:15:24,110 INFO L226 Difference]: Without dead ends: 1506 [2024-11-22 21:15:24,110 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-22 21:15:24,111 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 9 mSDsluCounter, 4520 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6131 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:24,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6131 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:15:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-22 21:15:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1505. [2024-11-22 21:15:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-22 21:15:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-22 21:15:24,140 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-22 21:15:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:24,140 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-22 21:15:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-22 21:15:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 21:15:24,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:24,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] [2024-11-22 21:15:24,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:15:24,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 545873213, now seen corresponding path program 1 times [2024-11-22 21:15:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:24,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402023219] [2024-11-22 21:15:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:24,346 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-22 21:15:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402023219] [2024-11-22 21:15:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402023219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:15:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798901644] [2024-11-22 21:15:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:15:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:15:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:15:24,349 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:25,576 INFO L93 Difference]: Finished difference Result 1510 states and 1764 transitions. [2024-11-22 21:15:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:15:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-22 21:15:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:25,579 INFO L225 Difference]: With dead ends: 1510 [2024-11-22 21:15:25,579 INFO L226 Difference]: Without dead ends: 1510 [2024-11-22 21:15:25,580 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-22 21:15:25,580 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 12 mSDsluCounter, 5868 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7474 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:25,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7474 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:15:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-22 21:15:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-11-22 21:15:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-22 21:15:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-22 21:15:25,599 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-22 21:15:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:25,600 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-22 21:15:25,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-22 21:15:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 21:15:25,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:25,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:15:25,601 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -749829340, now seen corresponding path program 1 times [2024-11-22 21:15:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685958385] [2024-11-22 21:15:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:26,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-22 21:15:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685958385] [2024-11-22 21:15:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685958385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59246448] [2024-11-22 21:15:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:26,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:26,329 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-22 21:15:26,330 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-22 21:15:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:26,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 21:15:26,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:26,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:26,750 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-22 21:15:26,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:26,766 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-22 21:15:26,795 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-22 21:15:26,802 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-22 21:15:26,890 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-22 21:15:26,895 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-22 21:15:27,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:27,016 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-22 21:15:27,021 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-22 21:15:27,063 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-22 21:15:27,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:15:27,084 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-22 21:15:27,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:15:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59246448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:27,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:15:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-22 21:15:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352622784] [2024-11-22 21:15:27,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:15:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 21:15:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 21:15:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=348, Unknown=11, NotChecked=0, Total=420 [2024-11-22 21:15:27,253 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:15:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:30,632 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-22 21:15:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:15:30,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-22 21:15:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:30,636 INFO L225 Difference]: With dead ends: 1512 [2024-11-22 21:15:30,636 INFO L226 Difference]: Without dead ends: 1512 [2024-11-22 21:15:30,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=494, Unknown=11, NotChecked=0, Total=600 [2024-11-22 21:15:30,637 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1542 mSDsluCounter, 7870 mSDsCounter, 0 mSdLazyCounter, 7304 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 8920 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 7304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:30,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 8920 Invalid, 7335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 7304 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-22 21:15:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-22 21:15:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-22 21:15:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-22 21:15:30,657 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-22 21:15:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-22 21:15:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.0) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:15:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-22 21:15:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 21:15:30,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:30,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:30,669 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-22 21:15:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 21:15:30,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -749829341, now seen corresponding path program 1 times [2024-11-22 21:15:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918406505] [2024-11-22 21:15:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:31,352 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-22 21:15:31,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:31,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918406505] [2024-11-22 21:15:31,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918406505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335235884] [2024-11-22 21:15:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:31,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:31,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:31,355 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-22 21:15:31,358 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-22 21:15:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:31,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 21:15:31,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:31,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:31,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:31,751 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-22 21:15:31,759 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-22 21:15:31,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:31,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:15:31,851 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-22 21:15:31,854 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-22 21:15:31,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:15:31,898 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-22 21:15:31,898 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-22 21:15:31,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335235884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:31,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:15:31,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-22 21:15:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641707856] [2024-11-22 21:15:31,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:15:31,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:15:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:15:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2024-11-22 21:15:31,929 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:15:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:34,395 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-22 21:15:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:15:34,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-22 21:15:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:34,398 INFO L225 Difference]: With dead ends: 1511 [2024-11-22 21:15:34,398 INFO L226 Difference]: Without dead ends: 1511 [2024-11-22 21:15:34,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2024-11-22 21:15:34,399 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 1538 mSDsluCounter, 9159 mSDsCounter, 0 mSdLazyCounter, 5977 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 10204 SdHoareTripleChecker+Invalid, 6003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:34,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 10204 Invalid, 6003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5977 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 21:15:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-22 21:15:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-22 21:15:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-22 21:15:34,420 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-22 21:15:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:34,420 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-22 21:15:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:15:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-22 21:15:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 21:15:34,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:34,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:34,437 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-22 21:15:34,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 21:15:34,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328473, now seen corresponding path program 1 times [2024-11-22 21:15:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132612551] [2024-11-22 21:15:34,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:35,129 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-22 21:15:35,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:35,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132612551] [2024-11-22 21:15:35,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132612551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:35,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:35,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 21:15:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731936805] [2024-11-22 21:15:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:35,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:15:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:35,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:15:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:15:35,131 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:37,070 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-22 21:15:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:15:37,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-22 21:15:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:37,074 INFO L225 Difference]: With dead ends: 1515 [2024-11-22 21:15:37,074 INFO L226 Difference]: Without dead ends: 1515 [2024-11-22 21:15:37,074 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-22 21:15:37,075 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1547 mSDsluCounter, 7152 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 8196 SdHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:37,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 8196 Invalid, 4818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:15:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-22 21:15:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-22 21:15:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-22 21:15:37,093 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-22 21:15:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:37,094 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-22 21:15:37,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-22 21:15:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 21:15:37,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:37,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:37,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 21:15:37,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328474, now seen corresponding path program 1 times [2024-11-22 21:15:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945976812] [2024-11-22 21:15:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:37,751 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-22 21:15:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945976812] [2024-11-22 21:15:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945976812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:15:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436644602] [2024-11-22 21:15:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:15:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:15:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:15:37,754 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:40,587 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-22 21:15:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:15:40,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-22 21:15:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:40,590 INFO L225 Difference]: With dead ends: 1514 [2024-11-22 21:15:40,590 INFO L226 Difference]: Without dead ends: 1514 [2024-11-22 21:15:40,590 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-22 21:15:40,591 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1561 mSDsluCounter, 6046 mSDsCounter, 0 mSdLazyCounter, 5873 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 7097 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:40,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 7097 Invalid, 5897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5873 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-22 21:15:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-22 21:15:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-22 21:15:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-22 21:15:40,608 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-22 21:15:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:40,608 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-22 21:15:40,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-22 21:15:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 21:15:40,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:40,610 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-22 21:15:40,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:15:40,610 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -40368589, now seen corresponding path program 1 times [2024-11-22 21:15:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121997597] [2024-11-22 21:15:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:41,133 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-22 21:15:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121997597] [2024-11-22 21:15:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121997597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502470235] [2024-11-22 21:15:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:41,137 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-22 21:15:41,139 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-22 21:15:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:41,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 21:15:41,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:41,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:41,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:41,508 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-22 21:15:41,515 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-22 21:15:41,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:41,567 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-22 21:15:41,613 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:41,614 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-22 21:15:41,629 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-22 21:15:41,632 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-22 21:15:41,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:15:41,735 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-22 21:15:41,735 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-22 21:15:41,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_928 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_931))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_928)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-22 21:15:41,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502470235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:41,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:15:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-22 21:15:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230253630] [2024-11-22 21:15:41,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:15:41,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:15:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:15:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=247, Unknown=12, NotChecked=32, Total=342 [2024-11-22 21:15:41,747 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:43,688 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-22 21:15:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:15:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-22 21:15:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:43,691 INFO L225 Difference]: With dead ends: 1513 [2024-11-22 21:15:43,692 INFO L226 Difference]: Without dead ends: 1513 [2024-11-22 21:15:43,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=482, Unknown=16, NotChecked=46, Total=650 [2024-11-22 21:15:43,693 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1536 mSDsluCounter, 7147 mSDsCounter, 0 mSdLazyCounter, 4783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 8191 SdHoareTripleChecker+Invalid, 4808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:43,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 8191 Invalid, 4808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4783 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:15:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-22 21:15:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-22 21:15:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-22 21:15:43,709 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-22 21:15:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:43,709 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-22 21:15:43,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-22 21:15:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 21:15:43,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:43,710 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-22 21:15:43,720 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-22 21:15:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:43,911 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:43,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -40368588, now seen corresponding path program 1 times [2024-11-22 21:15:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553284789] [2024-11-22 21:15:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:44,690 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-22 21:15:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553284789] [2024-11-22 21:15:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553284789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762851196] [2024-11-22 21:15:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:44,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:44,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:44,694 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-22 21:15:44,697 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-22 21:15:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:44,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 21:15:44,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:45,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:45,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 21:15:45,081 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-22 21:15:45,104 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-22 21:15:45,112 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-22 21:15:45,196 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-22 21:15:45,201 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-22 21:15:45,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:45,297 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-22 21:15:45,303 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-22 21:15:45,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:45,388 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-22 21:15:45,393 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-22 21:15:45,415 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-22 21:15:45,419 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-22 21:15:45,438 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-22 21:15:45,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:15:45,669 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1079) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1073 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1078))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1079) .cse1 v_ArrVal_1072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 21:15:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762851196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:45,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:15:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-22 21:15:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744292549] [2024-11-22 21:15:45,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:15:45,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 21:15:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:45,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 21:15:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=455, Unknown=20, NotChecked=44, Total=600 [2024-11-22 21:15:45,673 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:15:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:48,767 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-22 21:15:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:15:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-22 21:15:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:48,770 INFO L225 Difference]: With dead ends: 1512 [2024-11-22 21:15:48,770 INFO L226 Difference]: Without dead ends: 1512 [2024-11-22 21:15:48,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=665, Unknown=22, NotChecked=54, Total=870 [2024-11-22 21:15:48,771 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1540 mSDsluCounter, 7847 mSDsCounter, 0 mSdLazyCounter, 7294 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 8896 SdHoareTripleChecker+Invalid, 7336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 7294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:48,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 8896 Invalid, 7336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 7294 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 21:15:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-22 21:15:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-22 21:15:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:15:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-22 21:15:48,786 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-22 21:15:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:48,786 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-22 21:15:48,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:15:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-22 21:15:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 21:15:48,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:48,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:48,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 21:15:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:48,991 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417764, now seen corresponding path program 1 times [2024-11-22 21:15:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958386350] [2024-11-22 21:15:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:49,538 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-22 21:15:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958386350] [2024-11-22 21:15:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958386350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 21:15:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221074556] [2024-11-22 21:15:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:49,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 21:15:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 21:15:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:15:49,540 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:51,539 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-22 21:15:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:15:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-22 21:15:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:51,542 INFO L225 Difference]: With dead ends: 1516 [2024-11-22 21:15:51,542 INFO L226 Difference]: Without dead ends: 1516 [2024-11-22 21:15:51,543 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-22 21:15:51,547 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1566 mSDsluCounter, 7159 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 8202 SdHoareTripleChecker+Invalid, 4818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:51,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 8202 Invalid, 4818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:15:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-22 21:15:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-22 21:15:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-22 21:15:51,561 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-22 21:15:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-22 21:15:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-22 21:15:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 21:15:51,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:51,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:15:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 21:15:51,563 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:51,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417765, now seen corresponding path program 1 times [2024-11-22 21:15:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108759333] [2024-11-22 21:15:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:52,333 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-22 21:15:52,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:52,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108759333] [2024-11-22 21:15:52,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108759333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:15:52,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:15:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:15:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658990007] [2024-11-22 21:15:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:15:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:15:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:52,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:15:52,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:15:52,335 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:54,806 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-22 21:15:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:15:54,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-22 21:15:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:54,809 INFO L225 Difference]: With dead ends: 1515 [2024-11-22 21:15:54,810 INFO L226 Difference]: Without dead ends: 1515 [2024-11-22 21:15:54,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:15:54,810 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1545 mSDsluCounter, 6240 mSDsCounter, 0 mSdLazyCounter, 5652 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 7290 SdHoareTripleChecker+Invalid, 5676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:54,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 7290 Invalid, 5676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5652 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 21:15:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-22 21:15:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-22 21:15:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-22 21:15:54,829 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-22 21:15:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:54,829 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-22 21:15:54,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:15:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-22 21:15:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 21:15:54,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:54,830 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-22 21:15:54,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 21:15:54,831 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:54,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -29162422, now seen corresponding path program 1 times [2024-11-22 21:15:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774027086] [2024-11-22 21:15:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:55,402 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-22 21:15:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774027086] [2024-11-22 21:15:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774027086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064578560] [2024-11-22 21:15:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:55,405 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-22 21:15:55,408 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-22 21:15:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:55,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 21:15:55,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:55,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:55,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:55,772 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-22 21:15:55,779 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-22 21:15:55,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:55,857 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-22 21:15:55,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:55,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:15:55,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:55,948 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-22 21:15:55,961 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-22 21:15:55,966 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-22 21:15:55,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:15:55,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1361) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:15:55,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 (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_1361) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 21:15:55,988 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1360))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1361)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:15:56,046 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-22 21:15:56,046 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-22 21:15:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064578560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:56,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:15:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2024-11-22 21:15:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560622081] [2024-11-22 21:15:56,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:15:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 21:15:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:15:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 21:15:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=347, Unknown=16, NotChecked=120, Total=552 [2024-11-22 21:15:56,096 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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-22 21:15:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:15:58,327 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-22 21:15:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:15:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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 92 [2024-11-22 21:15:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:15:58,330 INFO L225 Difference]: With dead ends: 1514 [2024-11-22 21:15:58,330 INFO L226 Difference]: Without dead ends: 1514 [2024-11-22 21:15:58,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=672, Unknown=16, NotChecked=168, Total=992 [2024-11-22 21:15:58,331 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1532 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 5376 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 9206 SdHoareTripleChecker+Invalid, 5402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:15:58,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 9206 Invalid, 5402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5376 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:15:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-22 21:15:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-22 21:15:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:15:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-22 21:15:58,346 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-22 21:15:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:15:58,346 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-22 21:15:58,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 19 states have internal predecessors, (139), 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-22 21:15:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-22 21:15:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 21:15:58,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:15:58,348 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-22 21:15:58,358 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-22 21:15:58,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 21:15:58,549 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:15:58,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:15:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash -29162421, now seen corresponding path program 1 times [2024-11-22 21:15:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:15:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192881204] [2024-11-22 21:15:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:15:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:59,354 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-22 21:15:59,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:15:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192881204] [2024-11-22 21:15:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192881204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:15:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776005609] [2024-11-22 21:15:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:15:59,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:15:59,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:15:59,356 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-22 21:15:59,359 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-22 21:15:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:15:59,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 21:15:59,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:15:59,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:15:59,679 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-22 21:15:59,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:15:59,687 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-22 21:15:59,710 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-22 21:15:59,712 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-22 21:15:59,773 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-22 21:15:59,776 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-22 21:15:59,847 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:59,847 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-22 21:15:59,853 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-22 21:15:59,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:59,910 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-22 21:15:59,916 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-22 21:15:59,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:15:59,958 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-22 21:15:59,963 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-22 21:15:59,984 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-22 21:15:59,989 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-22 21:16:00,003 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-22 21:16:00,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:16:00,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1520 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 21:16:00,056 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_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1520 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-22 21:16:00,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1517))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1518) .cse0 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1518) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-22 21:16:00,092 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_1520 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1518) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1517))) (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_1518) .cse2 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-22 21:16:00,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1525))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1517))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1526) .cse0 v_ArrVal_1518) .cse1 v_ArrVal_1520) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1519) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1525))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1526) .cse5 v_ArrVal_1518) (select (select (store .cse6 .cse5 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1520))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-22 21:16:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776005609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:16:00,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:16:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-11-22 21:16:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630802510] [2024-11-22 21:16:00,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:16:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:16:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:16:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:16:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2024-11-22 21:16:00,151 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:16:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:16:05,039 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-22 21:16:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:16:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-22 21:16:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:16:05,043 INFO L225 Difference]: With dead ends: 1513 [2024-11-22 21:16:05,043 INFO L226 Difference]: Without dead ends: 1513 [2024-11-22 21:16:05,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2024-11-22 21:16:05,044 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1539 mSDsluCounter, 11036 mSDsCounter, 0 mSdLazyCounter, 10562 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 12084 SdHoareTripleChecker+Invalid, 10604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:16:05,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 12084 Invalid, 10604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 10562 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-22 21:16:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-22 21:16:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-22 21:16:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 21:16:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-22 21:16:05,060 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-22 21:16:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:16:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-22 21:16:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.7368421052631575) internal successors, (147), 22 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:16:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-22 21:16:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 21:16:05,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:16:05,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:16:05,073 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-22 21:16:05,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:16:05,264 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:16:05,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:16:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash 111786272, now seen corresponding path program 1 times [2024-11-22 21:16:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:16:05,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101635523] [2024-11-22 21:16:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:16:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:05,872 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-22 21:16:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:16:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101635523] [2024-11-22 21:16:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101635523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:16:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:16:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 21:16:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835503863] [2024-11-22 21:16:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:16:05,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:16:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:16:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:16:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:16:05,876 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:16:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:16:08,206 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-22 21:16:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:16:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-22 21:16:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:16:08,208 INFO L225 Difference]: With dead ends: 1517 [2024-11-22 21:16:08,209 INFO L226 Difference]: Without dead ends: 1517 [2024-11-22 21:16:08,209 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-22 21:16:08,210 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1553 mSDsluCounter, 8134 mSDsCounter, 0 mSdLazyCounter, 5417 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 9176 SdHoareTripleChecker+Invalid, 5443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:16:08,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 9176 Invalid, 5443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5417 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:16:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-22 21:16:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-22 21:16:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:16:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-22 21:16:08,226 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-22 21:16:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:16:08,226 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-22 21:16:08,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:16:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-22 21:16:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 21:16:08,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:16:08,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:16:08,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 21:16:08,228 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:16:08,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:16:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 111786273, now seen corresponding path program 1 times [2024-11-22 21:16:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:16:08,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188173584] [2024-11-22 21:16:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:16:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:09,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-22 21:16:09,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:16:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188173584] [2024-11-22 21:16:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188173584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:16:09,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:16:09,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 21:16:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113324508] [2024-11-22 21:16:09,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:16:09,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:16:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:16:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:16:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:16:09,031 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:16:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:16:12,090 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-22 21:16:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:16:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-22 21:16:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:16:12,095 INFO L225 Difference]: With dead ends: 1516 [2024-11-22 21:16:12,095 INFO L226 Difference]: Without dead ends: 1516 [2024-11-22 21:16:12,095 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-22 21:16:12,096 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1545 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 6678 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 7897 SdHoareTripleChecker+Invalid, 6702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:16:12,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 7897 Invalid, 6702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6678 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-22 21:16:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-22 21:16:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-22 21:16:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.6717998075072185) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:16:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-22 21:16:12,112 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 94 [2024-11-22 21:16:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:16:12,112 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-22 21:16:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:16:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-22 21:16:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 21:16:12,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:16:12,113 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-22 21:16:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 21:16:12,114 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:16:12,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:16:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1193683462, now seen corresponding path program 1 times [2024-11-22 21:16:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:16:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539941785] [2024-11-22 21:16:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:16:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:12,675 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-22 21:16:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:16:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539941785] [2024-11-22 21:16:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539941785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:16:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854442671] [2024-11-22 21:16:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:12,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:16:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:16:12,680 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-22 21:16:12,681 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-22 21:16:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:12,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 21:16:12,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:16:12,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:16:13,019 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:16:13,019 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-22 21:16:13,027 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-22 21:16:13,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:13,110 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-22 21:16:13,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:13,159 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-22 21:16:13,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:13,206 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-22 21:16:13,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:13,253 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-22 21:16:13,264 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-22 21:16:13,267 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-22 21:16:13,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:16:13,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1833) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:16:13,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (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_1833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 21:16:13,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1831))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:16:13,434 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-22 21:16:13,434 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-22 21:16:13,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1836))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1831)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1832)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1833)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-22 21:16:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854442671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:16:13,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:16:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-22 21:16:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488339650] [2024-11-22 21:16:13,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:16:13,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 21:16:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:16:13,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 21:16:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=442, Unknown=34, NotChecked=188, Total=756 [2024-11-22 21:16:13,447 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:16:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:16:16,065 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-22 21:16:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:16:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-22 21:16:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:16:16,069 INFO L225 Difference]: With dead ends: 1515 [2024-11-22 21:16:16,069 INFO L226 Difference]: Without dead ends: 1515 [2024-11-22 21:16:16,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=856, Unknown=41, NotChecked=260, Total=1332 [2024-11-22 21:16:16,071 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1532 mSDsluCounter, 10166 mSDsCounter, 0 mSdLazyCounter, 6591 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 11208 SdHoareTripleChecker+Invalid, 6617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:16:16,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 11208 Invalid, 6617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6591 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 21:16:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-22 21:16:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-22 21:16:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1039 states have (on average 1.670837343599615) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-22 21:16:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-22 21:16:16,086 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 95 [2024-11-22 21:16:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:16:16,086 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-22 21:16:16,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.578947368421052) internal successors, (144), 21 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 21:16:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-22 21:16:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 21:16:16,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:16:16,088 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-22 21:16:16,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 21:16:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:16:16,288 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-22 21:16:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:16:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1193683461, now seen corresponding path program 1 times [2024-11-22 21:16:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:16:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977872731] [2024-11-22 21:16:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:16:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:17,127 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-22 21:16:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:16:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977872731] [2024-11-22 21:16:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977872731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:16:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896544082] [2024-11-22 21:16:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:16:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:16:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:16:17,129 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-22 21:16:17,130 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-22 21:16:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:16:17,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 21:16:17,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:16:17,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:16:17,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:16:17,497 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-22 21:16:17,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:16:17,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:16:17,531 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-22 21:16:17,587 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-22 21:16:17,590 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-22 21:16:17,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:17,660 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-22 21:16:17,667 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-22 21:16:17,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:17,735 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-22 21:16:17,742 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-22 21:16:17,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:17,801 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-22 21:16:17,805 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-22 21:16:17,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:16:17,863 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-22 21:16:17,866 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-22 21:16:17,879 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-22 21:16:17,891 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-22 21:16:17,907 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-22 21:16:17,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:16:18,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2004) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2003))) (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~mem53#1.base| v_ArrVal_2004) .cse1 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 21:16:18,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2003))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2004) .cse1 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2004) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-22 21:16:18,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2002))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2003))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001) .cse0 v_ArrVal_2004) .cse1 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2002))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2001) .cse5 v_ArrVal_2004) (select (select (store .cse6 .cse5 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2006))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-22 21:16:18,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2002))) (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_2001) .cse1 v_ArrVal_2004) (select (select (store .cse2 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2006))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2002))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2003))) (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_2001) .cse4 v_ArrVal_2004) .cse5 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-22 21:16:18,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2002))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2012) .cse0 v_ArrVal_2001) .cse1 v_ArrVal_2004) (select (select (store .cse2 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2006))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2011 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2011))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2002))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2003))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2012) .cse5 v_ArrVal_2001) .cse6 v_ArrVal_2004) .cse7 v_ArrVal_2006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2005) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-22 21:16:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896544082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:16:18,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:16:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-22 21:16:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158603149] [2024-11-22 21:16:18,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:16:18,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 21:16:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:16:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 21:16:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=635, Unknown=28, NotChecked=280, Total=1056 [2024-11-22 21:16:18,157 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.285714285714286) internal successors, (153), 24 states have internal predecessors, (153), 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)