./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:16:47,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:16:47,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:16:47,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:16:47,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:16:47,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:16:47,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:16:47,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:16:47,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:16:47,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:16:47,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:16:47,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:16:47,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:16:47,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:16:47,645 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:16:47,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:16:47,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:16:47,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:16:47,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:16:47,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:16:47,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:16:47,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:16:47,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:16:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:16:47,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:16:47,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:16:47,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:16:47,654 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-11-09 10:16:47,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:16:47,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:16:47,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:16:47,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:16:47,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:16:47,912 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_test10-1.i [2024-11-09 10:16:49,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:16:49,587 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:16:49,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-11-09 10:16:49,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38595ffbb/7447ff8e814b41aab51d7de09c057ec3/FLAG0040fbf08 [2024-11-09 10:16:49,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38595ffbb/7447ff8e814b41aab51d7de09c057ec3 [2024-11-09 10:16:49,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:16:49,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:16:49,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:16:49,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:16:49,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:16:49,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:16:49" (1/1) ... [2024-11-09 10:16:49,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687599da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:49, skipping insertion in model container [2024-11-09 10:16:49,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:16:49" (1/1) ... [2024-11-09 10:16:49,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:16:50,314 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-09 10:16:50,348 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-09 10:16:50,352 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-09 10:16:50,356 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-09 10:16:50,361 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-09 10:16:50,393 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-09 10:16:50,397 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-09 10:16:50,400 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-09 10:16:50,404 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-09 10:16:50,431 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-09 10:16:50,431 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-09 10:16:50,433 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-09 10:16:50,436 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-09 10:16:50,447 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-09 10:16:50,451 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-09 10:16:50,452 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-09 10:16:50,454 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-09 10:16:50,464 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-09 10:16:50,468 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-09 10:16:50,469 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-09 10:16:50,469 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-09 10:16:50,479 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-09 10:16:50,483 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-09 10:16:50,485 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-09 10:16:50,487 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-09 10:16:50,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:16:50,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:16:50,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:16:50,640 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:16:50,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50 WrapperNode [2024-11-09 10:16:50,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:16:50,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:16:50,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:16:50,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:16:50,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,749 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3443 [2024-11-09 10:16:50,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:16:50,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:16:50,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:16:50,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:16:50,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,876 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2024-11-09 10:16:50,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:50,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:51,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:16:51,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:16:51,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:16:51,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:16:51,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (1/1) ... [2024-11-09 10:16:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:16:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:51,054 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-09 10:16:51,060 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-09 10:16:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-09 10:16:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-09 10:16:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:16:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:16:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:16:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:16:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:16:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:16:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:16:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:16:51,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:16:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:16:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:16:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:16:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:16:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:16:51,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:16:51,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:16:51,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:16:51,441 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:16:51,469 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:16:51,491 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:16:55,154 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-09 10:16:55,154 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:16:55,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:16:55,192 INFO L316 CfgBuilder]: Removed 151 assume(true) statements. [2024-11-09 10:16:55,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:16:55 BoogieIcfgContainer [2024-11-09 10:16:55,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:16:55,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:16:55,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:16:55,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:16:55,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:16:49" (1/3) ... [2024-11-09 10:16:55,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36445e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:16:55, skipping insertion in model container [2024-11-09 10:16:55,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:16:50" (2/3) ... [2024-11-09 10:16:55,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36445e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:16:55, skipping insertion in model container [2024-11-09 10:16:55,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:16:55" (3/3) ... [2024-11-09 10:16:55,235 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-11-09 10:16:55,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:16:55,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-11-09 10:16:55,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:16:55,417 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;@1b17baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:16:55,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-09 10:16:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 10:16:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:16:55,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:55,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:16:55,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:16:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-09 10:16:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553356304] [2024-11-09 10:16:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:55,729 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-09 10:16:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553356304] [2024-11-09 10:16:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553356304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:55,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:16:55,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757451418] [2024-11-09 10:16:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:55,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:55,787 INFO L87 Difference]: Start difference. First operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:16:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:57,209 INFO L93 Difference]: Finished difference Result 3236 states and 3807 transitions. [2024-11-09 10:16:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:16:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:57,243 INFO L225 Difference]: With dead ends: 3236 [2024-11-09 10:16:57,243 INFO L226 Difference]: Without dead ends: 3234 [2024-11-09 10:16:57,245 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-09 10:16:57,248 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 2869 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:57,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2734 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:16:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2024-11-09 10:16:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2887. [2024-11-09 10:16:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 1917 states have (on average 1.8669796557120502) internal successors, (3579), 2871 states have internal predecessors, (3579), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 10:16:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3611 transitions. [2024-11-09 10:16:57,436 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3611 transitions. Word has length 3 [2024-11-09 10:16:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:57,437 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 3611 transitions. [2024-11-09 10:16:57,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:16:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3611 transitions. [2024-11-09 10:16:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:16:57,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:57,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:16:57,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:16:57,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:16:57,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-09 10:16:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68074912] [2024-11-09 10:16:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:16:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:57,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68074912] [2024-11-09 10:16:57,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68074912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:16:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637449040] [2024-11-09 10:16:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:57,528 INFO L87 Difference]: Start difference. First operand 2887 states and 3611 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:16:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:59,152 INFO L93 Difference]: Finished difference Result 4956 states and 6133 transitions. [2024-11-09 10:16:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 10:16:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:59,164 INFO L225 Difference]: With dead ends: 4956 [2024-11-09 10:16:59,164 INFO L226 Difference]: Without dead ends: 4956 [2024-11-09 10:16:59,164 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-09 10:16:59,165 INFO L432 NwaCegarLoop]: 2399 mSDtfsCounter, 2502 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:59,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4507 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:16:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2024-11-09 10:16:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4280. [2024-11-09 10:16:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 3308 states have (on average 1.835247883917775) internal successors, (6071), 4257 states have internal predecessors, (6071), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:16:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6117 transitions. [2024-11-09 10:16:59,224 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6117 transitions. Word has length 3 [2024-11-09 10:16:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 6117 transitions. [2024-11-09 10:16:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 10:16:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6117 transitions. [2024-11-09 10:16:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:16:59,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:59,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:16:59,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:16:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-09 10:16:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:59,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262537551] [2024-11-09 10:16:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:59,311 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-09 10:16:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262537551] [2024-11-09 10:16:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262537551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:16:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234295838] [2024-11-09 10:16:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:59,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:59,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:59,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:59,313 INFO L87 Difference]: Start difference. First operand 4280 states and 6117 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 10:17:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:00,484 INFO L93 Difference]: Finished difference Result 5364 states and 7438 transitions. [2024-11-09 10:17:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:17:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-09 10:17:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:00,499 INFO L225 Difference]: With dead ends: 5364 [2024-11-09 10:17:00,499 INFO L226 Difference]: Without dead ends: 5364 [2024-11-09 10:17:00,499 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-09 10:17:00,500 INFO L432 NwaCegarLoop]: 3528 mSDtfsCounter, 2840 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:00,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 4697 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:17:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2024-11-09 10:17:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4188. [2024-11-09 10:17:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 3308 states have (on average 1.7868802902055623) internal successors, (5911), 4165 states have internal predecessors, (5911), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5957 transitions. [2024-11-09 10:17:00,633 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5957 transitions. Word has length 8 [2024-11-09 10:17:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:00,634 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5957 transitions. [2024-11-09 10:17:00,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 10:17:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5957 transitions. [2024-11-09 10:17:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:17:00,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:00,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:17:00,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-09 10:17:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129774926] [2024-11-09 10:17:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:00,729 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-09 10:17:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129774926] [2024-11-09 10:17:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129774926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:17:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469012134] [2024-11-09 10:17:00,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:17:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:17:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:17:00,734 INFO L87 Difference]: Start difference. First operand 4188 states and 5957 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 10:17:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:02,080 INFO L93 Difference]: Finished difference Result 6923 states and 9906 transitions. [2024-11-09 10:17:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:17:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-09 10:17:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:02,098 INFO L225 Difference]: With dead ends: 6923 [2024-11-09 10:17:02,099 INFO L226 Difference]: Without dead ends: 6923 [2024-11-09 10:17:02,099 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-09 10:17:02,100 INFO L432 NwaCegarLoop]: 3882 mSDtfsCounter, 2319 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 5660 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:02,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5660 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:17:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2024-11-09 10:17:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 4720. [2024-11-09 10:17:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4720 states, 3850 states have (on average 1.7805194805194806) internal successors, (6855), 4697 states have internal predecessors, (6855), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 6901 transitions. [2024-11-09 10:17:02,186 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 6901 transitions. Word has length 8 [2024-11-09 10:17:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 4720 states and 6901 transitions. [2024-11-09 10:17:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 10:17:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 6901 transitions. [2024-11-09 10:17:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:17:02,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:02,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:02,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:17:02,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash -342826361, now seen corresponding path program 1 times [2024-11-09 10:17:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588849682] [2024-11-09 10:17:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:02,286 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-09 10:17:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:02,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588849682] [2024-11-09 10:17:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588849682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:02,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:02,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686768778] [2024-11-09 10:17:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:02,290 INFO L87 Difference]: Start difference. First operand 4720 states and 6901 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-09 10:17:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:02,543 INFO L93 Difference]: Finished difference Result 6557 states and 9343 transitions. [2024-11-09 10:17:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:17:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-09 10:17:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:02,573 INFO L225 Difference]: With dead ends: 6557 [2024-11-09 10:17:02,574 INFO L226 Difference]: Without dead ends: 6557 [2024-11-09 10:17:02,574 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-09 10:17:02,575 INFO L432 NwaCegarLoop]: 3442 mSDtfsCounter, 1449 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 9732 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:02,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:17:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-09 10:17:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4722. [2024-11-09 10:17:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 3852 states have (on average 1.7801142263759087) internal successors, (6857), 4699 states have internal predecessors, (6857), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-09 10:17:02,633 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 11 [2024-11-09 10:17:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:02,633 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-09 10:17:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-09 10:17:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-09 10:17:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:17:02,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:02,635 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] [2024-11-09 10:17:02,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:17:02,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:02,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1711966207, now seen corresponding path program 1 times [2024-11-09 10:17:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:02,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992177008] [2024-11-09 10:17:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:17:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992177008] [2024-11-09 10:17:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992177008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196233323] [2024-11-09 10:17:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:02,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:02,743 INFO L87 Difference]: Start difference. First operand 4722 states and 6903 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:17:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:02,959 INFO L93 Difference]: Finished difference Result 6557 states and 9342 transitions. [2024-11-09 10:17:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:17:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-09 10:17:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:02,972 INFO L225 Difference]: With dead ends: 6557 [2024-11-09 10:17:02,973 INFO L226 Difference]: Without dead ends: 6557 [2024-11-09 10:17:02,973 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-09 10:17:02,973 INFO L432 NwaCegarLoop]: 3442 mSDtfsCounter, 1438 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 9732 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:02,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:17:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-09 10:17:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4732. [2024-11-09 10:17:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 3862 states have (on average 1.7780942516830658) internal successors, (6867), 4709 states have internal predecessors, (6867), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6913 transitions. [2024-11-09 10:17:03,033 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6913 transitions. Word has length 20 [2024-11-09 10:17:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:03,033 INFO L471 AbstractCegarLoop]: Abstraction has 4732 states and 6913 transitions. [2024-11-09 10:17:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:17:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6913 transitions. [2024-11-09 10:17:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:17:03,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:03,034 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] [2024-11-09 10:17:03,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:17:03,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-09 10:17:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447833460] [2024-11-09 10:17:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:17:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447833460] [2024-11-09 10:17:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447833460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:17:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982053540] [2024-11-09 10:17:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:03,074 INFO L87 Difference]: Start difference. First operand 4732 states and 6913 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:17:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:04,238 INFO L93 Difference]: Finished difference Result 4807 states and 7019 transitions. [2024-11-09 10:17:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:17:04,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-09 10:17:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:04,245 INFO L225 Difference]: With dead ends: 4807 [2024-11-09 10:17:04,245 INFO L226 Difference]: Without dead ends: 4807 [2024-11-09 10:17:04,246 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-09 10:17:04,246 INFO L432 NwaCegarLoop]: 2025 mSDtfsCounter, 3103 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:04,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3925 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:17:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2024-11-09 10:17:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4709. [2024-11-09 10:17:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 3862 states have (on average 1.7661833247022267) internal successors, (6821), 4686 states have internal predecessors, (6821), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 6867 transitions. [2024-11-09 10:17:04,302 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 6867 transitions. Word has length 20 [2024-11-09 10:17:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:04,303 INFO L471 AbstractCegarLoop]: Abstraction has 4709 states and 6867 transitions. [2024-11-09 10:17:04,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-09 10:17:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 6867 transitions. [2024-11-09 10:17:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:17:04,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:04,304 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] [2024-11-09 10:17:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:17:04,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -286362848, now seen corresponding path program 1 times [2024-11-09 10:17:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720258328] [2024-11-09 10:17:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:04,365 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-09 10:17:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720258328] [2024-11-09 10:17:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720258328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:17:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771923069] [2024-11-09 10:17:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:17:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:17:04,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:17:04,368 INFO L87 Difference]: Start difference. First operand 4709 states and 6867 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09 10:17:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:04,409 INFO L93 Difference]: Finished difference Result 4571 states and 6661 transitions. [2024-11-09 10:17:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:17:04,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-09 10:17:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:04,416 INFO L225 Difference]: With dead ends: 4571 [2024-11-09 10:17:04,416 INFO L226 Difference]: Without dead ends: 4571 [2024-11-09 10:17:04,416 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-09 10:17:04,417 INFO L432 NwaCegarLoop]: 2856 mSDtfsCounter, 61 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5659 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-09 10:17:04,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5659 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:17:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2024-11-09 10:17:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4571. [2024-11-09 10:17:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4571 states, 3736 states have (on average 1.770610278372591) internal successors, (6615), 4548 states have internal predecessors, (6615), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6661 transitions. [2024-11-09 10:17:04,471 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6661 transitions. Word has length 20 [2024-11-09 10:17:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:04,472 INFO L471 AbstractCegarLoop]: Abstraction has 4571 states and 6661 transitions. [2024-11-09 10:17:04,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09 10:17:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6661 transitions. [2024-11-09 10:17:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 10:17:04,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:04,474 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] [2024-11-09 10:17:04,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:17:04,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:04,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -316632036, now seen corresponding path program 1 times [2024-11-09 10:17:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454490919] [2024-11-09 10:17:04,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:04,523 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-09 10:17:04,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454490919] [2024-11-09 10:17:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454490919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:04,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012276792] [2024-11-09 10:17:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:04,527 INFO L87 Difference]: Start difference. First operand 4571 states and 6661 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-09 10:17:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:04,602 INFO L93 Difference]: Finished difference Result 4542 states and 6611 transitions. [2024-11-09 10:17:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:17:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-09 10:17:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:04,609 INFO L225 Difference]: With dead ends: 4542 [2024-11-09 10:17:04,609 INFO L226 Difference]: Without dead ends: 4542 [2024-11-09 10:17:04,610 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-09 10:17:04,612 INFO L432 NwaCegarLoop]: 2821 mSDtfsCounter, 41 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8435 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:04,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:17:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-11-09 10:17:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4536. [2024-11-09 10:17:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3708 states have (on average 1.7688781014023733) internal successors, (6559), 4513 states have internal predecessors, (6559), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6605 transitions. [2024-11-09 10:17:04,653 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6605 transitions. Word has length 22 [2024-11-09 10:17:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:04,653 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 6605 transitions. [2024-11-09 10:17:04,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-09 10:17:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6605 transitions. [2024-11-09 10:17:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 10:17:04,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:04,654 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] [2024-11-09 10:17:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:17:04,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash -828222326, now seen corresponding path program 1 times [2024-11-09 10:17:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792877629] [2024-11-09 10:17:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:17:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792877629] [2024-11-09 10:17:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792877629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:04,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:17:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246391098] [2024-11-09 10:17:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:04,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:04,796 INFO L87 Difference]: Start difference. First operand 4536 states and 6605 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 10:17:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:06,433 INFO L93 Difference]: Finished difference Result 6833 states and 9754 transitions. [2024-11-09 10:17:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:17:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-09 10:17:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:06,454 INFO L225 Difference]: With dead ends: 6833 [2024-11-09 10:17:06,455 INFO L226 Difference]: Without dead ends: 6833 [2024-11-09 10:17:06,455 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-09 10:17:06,459 INFO L432 NwaCegarLoop]: 2286 mSDtfsCounter, 2318 mSDsluCounter, 3649 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 5935 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:06,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 5935 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:17:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2024-11-09 10:17:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 4532. [2024-11-09 10:17:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.766720604099245) internal successors, (6551), 4509 states have internal predecessors, (6551), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6597 transitions. [2024-11-09 10:17:06,554 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6597 transitions. Word has length 36 [2024-11-09 10:17:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:06,555 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6597 transitions. [2024-11-09 10:17:06,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 10:17:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6597 transitions. [2024-11-09 10:17:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 10:17:06,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:06,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:06,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:17:06,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 852766398, now seen corresponding path program 1 times [2024-11-09 10:17:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011875214] [2024-11-09 10:17:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:06,680 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-09 10:17:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011875214] [2024-11-09 10:17:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011875214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993379764] [2024-11-09 10:17:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:06,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:17:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:06,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:17:06,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:17:06,681 INFO L87 Difference]: Start difference. First operand 4532 states and 6597 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:06,762 INFO L93 Difference]: Finished difference Result 4532 states and 6589 transitions. [2024-11-09 10:17:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:17:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 10:17:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:06,769 INFO L225 Difference]: With dead ends: 4532 [2024-11-09 10:17:06,769 INFO L226 Difference]: Without dead ends: 4532 [2024-11-09 10:17:06,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:17:06,770 INFO L432 NwaCegarLoop]: 2816 mSDtfsCounter, 21 mSDsluCounter, 5601 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8417 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:06,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:17:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2024-11-09 10:17:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4532. [2024-11-09 10:17:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.7645631067961165) internal successors, (6543), 4509 states have internal predecessors, (6543), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 10:17:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6589 transitions. [2024-11-09 10:17:06,836 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6589 transitions. Word has length 70 [2024-11-09 10:17:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:06,836 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6589 transitions. [2024-11-09 10:17:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6589 transitions. [2024-11-09 10:17:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:17:06,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:06,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:17:06,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:06,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1685969162, now seen corresponding path program 1 times [2024-11-09 10:17:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563007279] [2024-11-09 10:17:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:06,956 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-09 10:17:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563007279] [2024-11-09 10:17:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563007279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:17:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691689948] [2024-11-09 10:17:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:17:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:06,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:17:06,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:17:06,957 INFO L87 Difference]: Start difference. First operand 4532 states and 6589 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:07,028 INFO L93 Difference]: Finished difference Result 6036 states and 8768 transitions. [2024-11-09 10:17:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:17:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 10:17:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:07,038 INFO L225 Difference]: With dead ends: 6036 [2024-11-09 10:17:07,038 INFO L226 Difference]: Without dead ends: 6036 [2024-11-09 10:17:07,038 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-09 10:17:07,039 INFO L432 NwaCegarLoop]: 2832 mSDtfsCounter, 1083 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 5601 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:07,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 5601 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:17:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2024-11-09 10:17:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 5385. [2024-11-09 10:17:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 4557 states have (on average 1.7469826640333552) internal successors, (7961), 5358 states have internal predecessors, (7961), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8015 transitions. [2024-11-09 10:17:07,086 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8015 transitions. Word has length 78 [2024-11-09 10:17:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:07,087 INFO L471 AbstractCegarLoop]: Abstraction has 5385 states and 8015 transitions. [2024-11-09 10:17:07,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8015 transitions. [2024-11-09 10:17:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:17:07,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:07,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:17:07,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1252654197, now seen corresponding path program 1 times [2024-11-09 10:17:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341145948] [2024-11-09 10:17:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:07,426 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-09 10:17:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341145948] [2024-11-09 10:17:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341145948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:07,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:17:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894920069] [2024-11-09 10:17:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:17:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:17:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:17:07,428 INFO L87 Difference]: Start difference. First operand 5385 states and 8015 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:09,091 INFO L93 Difference]: Finished difference Result 5301 states and 7873 transitions. [2024-11-09 10:17:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:17:09,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 10:17:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:09,101 INFO L225 Difference]: With dead ends: 5301 [2024-11-09 10:17:09,101 INFO L226 Difference]: Without dead ends: 5301 [2024-11-09 10:17:09,102 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-09 10:17:09,102 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 5265 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5275 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:09,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5275 Valid, 3045 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:17:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2024-11-09 10:17:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 4759. [2024-11-09 10:17:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4015 states have (on average 1.7073474470734744) internal successors, (6855), 4732 states have internal predecessors, (6855), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6909 transitions. [2024-11-09 10:17:09,162 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6909 transitions. Word has length 81 [2024-11-09 10:17:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:09,163 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6909 transitions. [2024-11-09 10:17:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:17:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6909 transitions. [2024-11-09 10:17:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:17:09,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:09,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:09,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:17:09,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash -420245411, now seen corresponding path program 1 times [2024-11-09 10:17:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:09,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879654307] [2024-11-09 10:17:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:09,401 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-09 10:17:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879654307] [2024-11-09 10:17:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879654307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903488851] [2024-11-09 10:17:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:17:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:17:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:17:09,405 INFO L87 Difference]: Start difference. First operand 4759 states and 6909 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-09 10:17:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:10,801 INFO L93 Difference]: Finished difference Result 4758 states and 6907 transitions. [2024-11-09 10:17:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:17:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-09 10:17:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:10,809 INFO L225 Difference]: With dead ends: 4758 [2024-11-09 10:17:10,810 INFO L226 Difference]: Without dead ends: 4758 [2024-11-09 10:17:10,810 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-09 10:17:10,810 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 2 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8487 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:10,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8487 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:17:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2024-11-09 10:17:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4758. [2024-11-09 10:17:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4015 states have (on average 1.7068493150684931) internal successors, (6853), 4731 states have internal predecessors, (6853), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6907 transitions. [2024-11-09 10:17:10,869 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6907 transitions. Word has length 86 [2024-11-09 10:17:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:10,870 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6907 transitions. [2024-11-09 10:17:10,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-09 10:17:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6907 transitions. [2024-11-09 10:17:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:17:10,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:10,874 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-09 10:17:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:17:10,874 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:10,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash -420245410, now seen corresponding path program 1 times [2024-11-09 10:17:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956579956] [2024-11-09 10:17:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:11,399 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-09 10:17:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956579956] [2024-11-09 10:17:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956579956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:11,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:11,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:17:11,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635830808] [2024-11-09 10:17:11,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:17:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:11,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:17:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:17:11,402 INFO L87 Difference]: Start difference. First operand 4758 states and 6907 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-09 10:17:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:13,153 INFO L93 Difference]: Finished difference Result 4757 states and 6905 transitions. [2024-11-09 10:17:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:17:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-09 10:17:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:13,162 INFO L225 Difference]: With dead ends: 4757 [2024-11-09 10:17:13,163 INFO L226 Difference]: Without dead ends: 4757 [2024-11-09 10:17:13,163 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-09 10:17:13,164 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 1 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8461 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:13,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8461 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:17:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2024-11-09 10:17:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4757. [2024-11-09 10:17:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4013 states have (on average 1.7072015948168453) internal successors, (6851), 4730 states have internal predecessors, (6851), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6905 transitions. [2024-11-09 10:17:13,239 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6905 transitions. Word has length 86 [2024-11-09 10:17:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6905 transitions. [2024-11-09 10:17:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-09 10:17:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6905 transitions. [2024-11-09 10:17:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:17:13,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:13,241 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-09 10:17:13,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:17:13,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:13,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -796304604, now seen corresponding path program 1 times [2024-11-09 10:17:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722911982] [2024-11-09 10:17:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:13,520 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-09 10:17:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:13,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722911982] [2024-11-09 10:17:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722911982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:17:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502243048] [2024-11-09 10:17:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:13,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:17:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:17:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:17:13,525 INFO L87 Difference]: Start difference. First operand 4757 states and 6905 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-09 10:17:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:15,439 INFO L93 Difference]: Finished difference Result 4775 states and 6938 transitions. [2024-11-09 10:17:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:17:15,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-09 10:17:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:15,451 INFO L225 Difference]: With dead ends: 4775 [2024-11-09 10:17:15,451 INFO L226 Difference]: Without dead ends: 4775 [2024-11-09 10:17:15,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:17:15,452 INFO L432 NwaCegarLoop]: 2707 mSDtfsCounter, 31 mSDsluCounter, 10436 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13143 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:15,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13143 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:17:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-09 10:17:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4766. [2024-11-09 10:17:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.7065406615269834) internal successors, (6862), 4737 states have internal predecessors, (6862), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-09 10:17:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6928 transitions. [2024-11-09 10:17:15,596 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6928 transitions. Word has length 94 [2024-11-09 10:17:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:15,596 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6928 transitions. [2024-11-09 10:17:15,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 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-09 10:17:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6928 transitions. [2024-11-09 10:17:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:17:15,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:15,597 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-09 10:17:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:17:15,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:15,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -796304603, now seen corresponding path program 1 times [2024-11-09 10:17:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535899532] [2024-11-09 10:17:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:15,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:16,013 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-09 10:17:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535899532] [2024-11-09 10:17:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535899532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:17:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142290426] [2024-11-09 10:17:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:16,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:17:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:17:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:17:16,016 INFO L87 Difference]: Start difference. First operand 4766 states and 6928 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-09 10:17:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:17,807 INFO L93 Difference]: Finished difference Result 4766 states and 6926 transitions. [2024-11-09 10:17:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:17:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-09 10:17:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:17,815 INFO L225 Difference]: With dead ends: 4766 [2024-11-09 10:17:17,815 INFO L226 Difference]: Without dead ends: 4766 [2024-11-09 10:17:17,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:17:17,816 INFO L432 NwaCegarLoop]: 2714 mSDtfsCounter, 43 mSDsluCounter, 8081 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10795 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:17,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 10795 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:17:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2024-11-09 10:17:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4766. [2024-11-09 10:17:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.706043272817707) internal successors, (6860), 4737 states have internal predecessors, (6860), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-09 10:17:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6926 transitions. [2024-11-09 10:17:17,876 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6926 transitions. Word has length 94 [2024-11-09 10:17:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:17,877 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6926 transitions. [2024-11-09 10:17:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-09 10:17:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6926 transitions. [2024-11-09 10:17:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:17:17,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:17,878 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-09 10:17:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:17:17,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1398690569, now seen corresponding path program 1 times [2024-11-09 10:17:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058578461] [2024-11-09 10:17:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:18,287 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-09 10:17:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058578461] [2024-11-09 10:17:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058578461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473910997] [2024-11-09 10:17:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:17:18,290 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-09 10:17:18,291 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-09 10:17:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:18,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:17:18,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:17:18,536 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-09 10:17:18,651 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:17:18,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:17:18,674 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-09 10:17:18,740 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-09 10:17:18,877 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:18,878 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-09 10:17:18,905 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-09 10:17:18,929 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-09 10:17:18,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:17:18,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473910997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:18,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:17:18,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:17:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472592083] [2024-11-09 10:17:18,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:17:18,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:17:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:17:18,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2024-11-09 10:17:18,976 INFO L87 Difference]: Start difference. First operand 4766 states and 6926 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-09 10:17:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:23,866 INFO L93 Difference]: Finished difference Result 4773 states and 6932 transitions. [2024-11-09 10:17:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:17:23,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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 95 [2024-11-09 10:17:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:23,877 INFO L225 Difference]: With dead ends: 4773 [2024-11-09 10:17:23,881 INFO L226 Difference]: Without dead ends: 4773 [2024-11-09 10:17:23,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=506, Unknown=7, NotChecked=0, Total=600 [2024-11-09 10:17:23,882 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2653 mSDsluCounter, 20558 mSDsCounter, 0 mSdLazyCounter, 10460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 22449 SdHoareTripleChecker+Invalid, 10487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 10460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:23,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2671 Valid, 22449 Invalid, 10487 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 10460 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 10:17:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2024-11-09 10:17:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 4770. [2024-11-09 10:17:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4025 states have (on average 1.7050931677018633) internal successors, (6863), 4740 states have internal predecessors, (6863), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:17:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6919 transitions. [2024-11-09 10:17:23,987 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6919 transitions. Word has length 95 [2024-11-09 10:17:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:23,987 INFO L471 AbstractCegarLoop]: Abstraction has 4770 states and 6919 transitions. [2024-11-09 10:17:23,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-09 10:17:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6919 transitions. [2024-11-09 10:17:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:17:23,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:23,990 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-09 10:17:24,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:17:24,190 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,SelfDestructingSolverStorable17 [2024-11-09 10:17:24,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1398690568, now seen corresponding path program 1 times [2024-11-09 10:17:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:24,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433896563] [2024-11-09 10:17:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:24,999 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-09 10:17:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433896563] [2024-11-09 10:17:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433896563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:24,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051094623] [2024-11-09 10:17:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:17:25,002 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-09 10:17:25,003 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-09 10:17:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:25,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:17:25,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:17:25,248 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-09 10:17:25,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:17:25,361 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-09 10:17:25,365 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-09 10:17:25,387 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-09 10:17:25,391 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-09 10:17:25,453 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-09 10:17:25,457 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-09 10:17:25,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:25,540 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-09 10:17:25,544 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-09 10:17:25,575 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-09 10:17:25,578 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-09 10:17:25,597 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-09 10:17:25,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:17:25,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_817 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-09 10:17:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051094623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:25,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:17:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:17:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756869069] [2024-11-09 10:17:25,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:17:25,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:17:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:17:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 10:17:25,699 INFO L87 Difference]: Start difference. First operand 4770 states and 6919 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-09 10:17:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:30,129 INFO L93 Difference]: Finished difference Result 4772 states and 6930 transitions. [2024-11-09 10:17:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:17:30,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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 95 [2024-11-09 10:17:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:30,137 INFO L225 Difference]: With dead ends: 4772 [2024-11-09 10:17:30,138 INFO L226 Difference]: Without dead ends: 4772 [2024-11-09 10:17:30,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 10:17:30,139 INFO L432 NwaCegarLoop]: 1897 mSDtfsCounter, 2693 mSDsluCounter, 12778 mSDsCounter, 0 mSdLazyCounter, 10053 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 14675 SdHoareTripleChecker+Invalid, 10116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 10053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:30,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 14675 Invalid, 10116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 10053 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 10:17:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-09 10:17:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4760. [2024-11-09 10:17:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4017 states have (on average 1.7057505601194922) internal successors, (6852), 4732 states have internal predecessors, (6852), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6906 transitions. [2024-11-09 10:17:30,196 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6906 transitions. Word has length 95 [2024-11-09 10:17:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:30,196 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6906 transitions. [2024-11-09 10:17:30,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-09 10:17:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6906 transitions. [2024-11-09 10:17:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:17:30,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:30,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:30,227 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-09 10:17:30,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:30,398 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1605417604, now seen corresponding path program 1 times [2024-11-09 10:17:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075836938] [2024-11-09 10:17:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:30,939 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-09 10:17:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075836938] [2024-11-09 10:17:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075836938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:17:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681895616] [2024-11-09 10:17:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:17:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:17:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:17:30,942 INFO L87 Difference]: Start difference. First operand 4760 states and 6906 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-09 10:17:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:33,986 INFO L93 Difference]: Finished difference Result 4779 states and 6938 transitions. [2024-11-09 10:17:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:17:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-09 10:17:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:33,996 INFO L225 Difference]: With dead ends: 4779 [2024-11-09 10:17:33,996 INFO L226 Difference]: Without dead ends: 4779 [2024-11-09 10:17:33,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:17:34,000 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2667 mSDsluCounter, 16821 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 18712 SdHoareTripleChecker+Invalid, 8756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:34,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 18712 Invalid, 8756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 10:17:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-09 10:17:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4775. [2024-11-09 10:17:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7040436616224262) internal successors, (6869), 4745 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:17:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6925 transitions. [2024-11-09 10:17:34,034 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6925 transitions. Word has length 97 [2024-11-09 10:17:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:34,034 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6925 transitions. [2024-11-09 10:17:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-09 10:17:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6925 transitions. [2024-11-09 10:17:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:17:34,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:34,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:34,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:17:34,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1605417603, now seen corresponding path program 1 times [2024-11-09 10:17:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:34,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907915696] [2024-11-09 10:17:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:34,639 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-09 10:17:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907915696] [2024-11-09 10:17:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907915696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:17:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908241659] [2024-11-09 10:17:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:17:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:17:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:17:34,643 INFO L87 Difference]: Start difference. First operand 4775 states and 6925 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-09 10:17:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:37,990 INFO L93 Difference]: Finished difference Result 4778 states and 6936 transitions. [2024-11-09 10:17:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:17:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 97 [2024-11-09 10:17:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:38,002 INFO L225 Difference]: With dead ends: 4778 [2024-11-09 10:17:38,002 INFO L226 Difference]: Without dead ends: 4778 [2024-11-09 10:17:38,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:17:38,006 INFO L432 NwaCegarLoop]: 1898 mSDtfsCounter, 2683 mSDsluCounter, 11601 mSDsCounter, 0 mSdLazyCounter, 8416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 13499 SdHoareTripleChecker+Invalid, 8455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:38,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 13499 Invalid, 8455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 8416 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 10:17:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-09 10:17:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4775. [2024-11-09 10:17:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7035475068221284) internal successors, (6867), 4745 states have internal predecessors, (6867), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:17:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6923 transitions. [2024-11-09 10:17:38,093 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6923 transitions. Word has length 97 [2024-11-09 10:17:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:38,093 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6923 transitions. [2024-11-09 10:17:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-09 10:17:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6923 transitions. [2024-11-09 10:17:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:17:38,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:38,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 10:17:38,095 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:38,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629065, now seen corresponding path program 1 times [2024-11-09 10:17:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230000249] [2024-11-09 10:17:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:38,590 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-09 10:17:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230000249] [2024-11-09 10:17:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230000249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945442388] [2024-11-09 10:17:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:17:38,596 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-09 10:17:38,597 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-09 10:17:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:38,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:17:38,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:17:38,861 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-09 10:17:38,974 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:17:38,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:17:39,001 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-09 10:17:39,056 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-09 10:17:39,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:39,146 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-09 10:17:39,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:39,208 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-09 10:17:39,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:17:39,252 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-09 10:17:39,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:17:39,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (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~mem55#1.base| v_ArrVal_1107))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:17:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945442388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:39,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:17:39,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:17:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425924359] [2024-11-09 10:17:39,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:17:39,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:17:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:17:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=454, Unknown=22, NotChecked=44, Total=600 [2024-11-09 10:17:39,349 INFO L87 Difference]: Start difference. First operand 4775 states and 6923 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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-09 10:17:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:44,187 INFO L93 Difference]: Finished difference Result 4777 states and 6934 transitions. [2024-11-09 10:17:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:17:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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 98 [2024-11-09 10:17:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:44,196 INFO L225 Difference]: With dead ends: 4777 [2024-11-09 10:17:44,196 INFO L226 Difference]: Without dead ends: 4777 [2024-11-09 10:17:44,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=629, Unknown=23, NotChecked=52, Total=812 [2024-11-09 10:17:44,197 INFO L432 NwaCegarLoop]: 1890 mSDtfsCounter, 2646 mSDsluCounter, 22420 mSDsCounter, 0 mSdLazyCounter, 11341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 24310 SdHoareTripleChecker+Invalid, 11364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:44,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 24310 Invalid, 11364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 11341 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 10:17:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-09 10:17:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4774. [2024-11-09 10:17:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4031 states have (on average 1.7030513520218309) internal successors, (6865), 4744 states have internal predecessors, (6865), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:17:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 6921 transitions. [2024-11-09 10:17:44,265 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 6921 transitions. Word has length 98 [2024-11-09 10:17:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 4774 states and 6921 transitions. [2024-11-09 10:17:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 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-09 10:17:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 6921 transitions. [2024-11-09 10:17:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:17:44,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:44,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:44,281 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-09 10:17:44,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:44,471 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629066, now seen corresponding path program 1 times [2024-11-09 10:17:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267082406] [2024-11-09 10:17:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:45,201 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-09 10:17:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267082406] [2024-11-09 10:17:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267082406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324070280] [2024-11-09 10:17:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:45,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:45,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:17:45,204 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-09 10:17:45,205 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-09 10:17:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:45,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:17:45,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:17:45,448 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-09 10:17:45,568 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-09 10:17:45,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:17:45,577 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-09 10:17:45,614 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-09 10:17:45,617 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-09 10:17:45,718 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-09 10:17:45,725 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-09 10:17:45,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:45,851 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-09 10:17:45,858 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-09 10:17:45,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:17:45,930 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-09 10:17:45,935 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-09 10:17:45,955 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-09 10:17:45,960 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-09 10:17:45,981 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-09 10:17:45,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:17:46,034 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1264) |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~mem57#1.base| v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:17:46,042 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_1264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:17:46,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1270) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1271))) (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~mem55#1.base| v_ArrVal_1270) .cse1 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:17:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324070280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:17:46,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:17:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 10:17:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728491138] [2024-11-09 10:17:46,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:17:46,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:17:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:17:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-09 10:17:46,080 INFO L87 Difference]: Start difference. First operand 4774 states and 6921 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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-09 10:17:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:52,230 INFO L93 Difference]: Finished difference Result 4776 states and 6932 transitions. [2024-11-09 10:17:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:17:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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 98 [2024-11-09 10:17:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:52,236 INFO L225 Difference]: With dead ends: 4776 [2024-11-09 10:17:52,237 INFO L226 Difference]: Without dead ends: 4776 [2024-11-09 10:17:52,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-09 10:17:52,238 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2652 mSDsluCounter, 17998 mSDsCounter, 0 mSdLazyCounter, 13021 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 19894 SdHoareTripleChecker+Invalid, 13049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:52,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 19894 Invalid, 13049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 13021 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-09 10:17:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-09 10:17:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4758. [2024-11-09 10:17:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4017 states have (on average 1.704754792133433) internal successors, (6848), 4730 states have internal predecessors, (6848), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 10:17:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6902 transitions. [2024-11-09 10:17:52,285 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6902 transitions. Word has length 98 [2024-11-09 10:17:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:52,286 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6902 transitions. [2024-11-09 10:17:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 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-09 10:17:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6902 transitions. [2024-11-09 10:17:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:17:52,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:52,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:52,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:17:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:17:52,492 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1760638795, now seen corresponding path program 1 times [2024-11-09 10:17:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349840894] [2024-11-09 10:17:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:52,885 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-09 10:17:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349840894] [2024-11-09 10:17:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349840894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:17:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579254054] [2024-11-09 10:17:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:17:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:17:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:17:52,887 INFO L87 Difference]: Start difference. First operand 4758 states and 6902 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-09 10:17:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:56,945 INFO L93 Difference]: Finished difference Result 4783 states and 6940 transitions. [2024-11-09 10:17:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:17:56,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 100 [2024-11-09 10:17:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:56,952 INFO L225 Difference]: With dead ends: 4783 [2024-11-09 10:17:56,952 INFO L226 Difference]: Without dead ends: 4783 [2024-11-09 10:17:56,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:17:56,953 INFO L432 NwaCegarLoop]: 1890 mSDtfsCounter, 2690 mSDsluCounter, 18687 mSDsCounter, 0 mSdLazyCounter, 9586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 20577 SdHoareTripleChecker+Invalid, 9610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 9586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:56,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 20577 Invalid, 9610 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 9586 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 10:17:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-09 10:17:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4779. [2024-11-09 10:17:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4037 states have (on average 1.7020064404260589) internal successors, (6871), 4749 states have internal predecessors, (6871), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:17:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6927 transitions. [2024-11-09 10:17:57,010 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6927 transitions. Word has length 100 [2024-11-09 10:17:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6927 transitions. [2024-11-09 10:17:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-09 10:17:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6927 transitions. [2024-11-09 10:17:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:17:57,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:57,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:17:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:17:57,014 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:17:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1760638796, now seen corresponding path program 1 times [2024-11-09 10:17:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185836099] [2024-11-09 10:17:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:57,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:17:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:57,800 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-09 10:17:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:57,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185836099] [2024-11-09 10:17:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185836099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:57,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:57,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:17:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295583362] [2024-11-09 10:17:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:57,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:17:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:17:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:17:57,803 INFO L87 Difference]: Start difference. First operand 4779 states and 6927 transitions. Second operand has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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-09 10:18:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:01,669 INFO L93 Difference]: Finished difference Result 4782 states and 6938 transitions. [2024-11-09 10:18:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:18:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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 100 [2024-11-09 10:18:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:01,674 INFO L225 Difference]: With dead ends: 4782 [2024-11-09 10:18:01,674 INFO L226 Difference]: Without dead ends: 4782 [2024-11-09 10:18:01,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:18:01,675 INFO L432 NwaCegarLoop]: 1897 mSDtfsCounter, 2667 mSDsluCounter, 11975 mSDsCounter, 0 mSdLazyCounter, 8016 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 13872 SdHoareTripleChecker+Invalid, 8038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 8016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:01,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 13872 Invalid, 8038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 8016 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 10:18:01,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2024-11-09 10:18:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4779. [2024-11-09 10:18:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4037 states have (on average 1.7015110230369086) internal successors, (6869), 4749 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:18:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6925 transitions. [2024-11-09 10:18:01,752 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6925 transitions. Word has length 100 [2024-11-09 10:18:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:01,752 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6925 transitions. [2024-11-09 10:18:01,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 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-09 10:18:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6925 transitions. [2024-11-09 10:18:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:18:01,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:01,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:01,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 10:18:01,760 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:18:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1166778078, now seen corresponding path program 1 times [2024-11-09 10:18:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:18:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382670575] [2024-11-09 10:18:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:18:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:18:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:02,331 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-09 10:18:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:18:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382670575] [2024-11-09 10:18:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382670575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:18:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439013280] [2024-11-09 10:18:02,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:02,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:18:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:18:02,335 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-09 10:18:02,342 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-09 10:18:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:02,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:18:02,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:02,682 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-09 10:18:02,785 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:18:02,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:18:02,816 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-09 10:18:02,891 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-09 10:18:03,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:03,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 42 treesize of output 41 [2024-11-09 10:18:03,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:03,077 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-09 10:18:03,137 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:03,137 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-09 10:18:03,150 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-09 10:18:03,194 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-09 10:18:03,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:03,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (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~mem57#1.base| v_ArrVal_1582))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:18:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439013280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:18:07,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:18:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006940749] [2024-11-09 10:18:07,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:07,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:18:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:18:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:18:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=608, Unknown=46, NotChecked=52, Total=812 [2024-11-09 10:18:07,528 INFO L87 Difference]: Start difference. First operand 4779 states and 6925 transitions. Second operand has 24 states, 21 states have (on average 7.761904761904762) internal successors, (163), 23 states have internal predecessors, (163), 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-09 10:18:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:18:14,364 INFO L93 Difference]: Finished difference Result 4781 states and 6936 transitions. [2024-11-09 10:18:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:18:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.761904761904762) internal successors, (163), 23 states have internal predecessors, (163), 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 101 [2024-11-09 10:18:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:18:14,371 INFO L225 Difference]: With dead ends: 4781 [2024-11-09 10:18:14,371 INFO L226 Difference]: Without dead ends: 4781 [2024-11-09 10:18:14,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=135, Invalid=815, Unknown=46, NotChecked=60, Total=1056 [2024-11-09 10:18:14,373 INFO L432 NwaCegarLoop]: 1889 mSDtfsCounter, 2641 mSDsluCounter, 22404 mSDsCounter, 0 mSdLazyCounter, 11325 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 24293 SdHoareTripleChecker+Invalid, 11351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:18:14,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 24293 Invalid, 11351 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 11325 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-09 10:18:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2024-11-09 10:18:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2024-11-09 10:18:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4778 states, 4037 states have (on average 1.7010156056477583) internal successors, (6867), 4748 states have internal predecessors, (6867), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-09 10:18:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6923 transitions. [2024-11-09 10:18:14,430 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6923 transitions. Word has length 101 [2024-11-09 10:18:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:18:14,431 INFO L471 AbstractCegarLoop]: Abstraction has 4778 states and 6923 transitions. [2024-11-09 10:18:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.761904761904762) internal successors, (163), 23 states have internal predecessors, (163), 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-09 10:18:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6923 transitions. [2024-11-09 10:18:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:18:14,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:18:14,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:18:14,454 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-09 10:18:14,633 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,SelfDestructingSolverStorable25 [2024-11-09 10:18:14,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-09 10:18:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:18:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1166778079, now seen corresponding path program 1 times [2024-11-09 10:18:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:18:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597290112] [2024-11-09 10:18:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:18:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 10:18:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:15,447 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-09 10:18:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:18:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597290112] [2024-11-09 10:18:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597290112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:18:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129442799] [2024-11-09 10:18:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:18:15,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:18:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:18:15,449 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-09 10:18:15,450 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-09 10:18:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:18:15,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 10:18:15,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:18:15,764 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-09 10:18:15,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:18:15,863 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-09 10:18:15,870 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-09 10:18:15,876 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-09 10:18:15,880 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-09 10:18:15,917 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-09 10:18:15,920 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-09 10:18:15,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:16,000 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-09 10:18:16,005 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-09 10:18:16,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:16,059 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-09 10:18:16,064 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-09 10:18:16,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:18:16,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:18:16,116 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-09 10:18:16,129 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-09 10:18:16,133 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-09 10:18:16,135 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-09 10:18:16,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:18:16,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-09 10:18:16,194 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_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:18:16,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1756))) (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~mem57#1.base| v_ArrVal_1755) .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-09 10:18:16,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1764))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1756))) (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~mem55#1.base| v_ArrVal_1763) .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1764))) (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~mem55#1.base| v_ArrVal_1763) .cse5 v_ArrVal_1755) (select (select (store .cse6 .cse5 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-09 10:18:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129442799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:18:16,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:18:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-09 10:18:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801758515] [2024-11-09 10:18:16,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:18:16,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:18:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:18:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:18:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=388, Unknown=7, NotChecked=172, Total=650 [2024-11-09 10:18:16,303 INFO L87 Difference]: Start difference. First operand 4778 states and 6923 transitions. Second operand has 19 states, 17 states have (on average 9.058823529411764) internal successors, (154), 18 states have internal predecessors, (154), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)