./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-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_OAT_test2-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 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:10:15,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:10:15,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:10:15,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:10:15,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:10:15,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:10:15,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:10:15,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:10:15,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:10:15,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:10:15,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:10:15,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:10:15,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:10:15,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:10:15,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:10:15,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:10:15,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:10:15,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:10:15,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:10:15,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:10:15,561 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:10:15,561 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:10:15,561 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:10:15,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:10:15,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:10:15,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:10:15,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:10:15,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:10:15,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:10:15,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:10:15,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:10:15,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:10:15,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:10:15,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:10:15,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:10:15,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:10:15,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:10:15,567 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-11-09 10:10:15,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:10:15,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:10:15,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:10:15,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:10:15,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:10:15,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-09 10:10:17,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:10:17,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:10:17,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-09 10:10:17,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe77d700/cc0ce3858ba64135a709ae347614eee6/FLAG3cfb1e2fe [2024-11-09 10:10:17,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe77d700/cc0ce3858ba64135a709ae347614eee6 [2024-11-09 10:10:17,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:10:17,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:10:17,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:10:17,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:10:17,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:10:17,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:10:17" (1/1) ... [2024-11-09 10:10:17,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678c0c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:17, skipping insertion in model container [2024-11-09 10:10:17,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:10:17" (1/1) ... [2024-11-09 10:10:17,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:10:17,942 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:10:17,984 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:10:17,990 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:10:17,996 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:10:18,004 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:10:18,044 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:10:18,047 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:10:18,049 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:10:18,050 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:10:18,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:10:18,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:10:18,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:10:18,226 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:10:18,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18 WrapperNode [2024-11-09 10:10:18,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:10:18,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:10:18,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:10:18,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:10:18,239 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:10:18" (1/1) ... [2024-11-09 10:10:18,297 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:10:18" (1/1) ... [2024-11-09 10:10:18,418 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1312 [2024-11-09 10:10:18,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:10:18,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:10:18,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:10:18,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:10:18,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,493 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-09 10:10:18,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:10:18,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:10:18,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:10:18,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:10:18,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (1/1) ... [2024-11-09 10:10:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:10:18,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:18,620 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:10:18,638 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:10:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:10:18,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:10:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:10:18,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:10:18,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:10:18,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:10:18,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:10:18,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:10:18,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:10:18,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:10:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:10:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:10:18,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:10:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:10:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:10:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:10:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:10:18,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:10:18,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:10:18,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:10:18,877 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:10:18,897 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:10:18,912 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:10:20,455 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-09 10:10:20,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:10:20,493 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:10:20,495 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:10:20,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:10:20 BoogieIcfgContainer [2024-11-09 10:10:20,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:10:20,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:10:20,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:10:20,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:10:20,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:10:17" (1/3) ... [2024-11-09 10:10:20,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7498725e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:10:20, skipping insertion in model container [2024-11-09 10:10:20,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:10:18" (2/3) ... [2024-11-09 10:10:20,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7498725e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:10:20, skipping insertion in model container [2024-11-09 10:10:20,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:10:20" (3/3) ... [2024-11-09 10:10:20,504 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2024-11-09 10:10:20,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:10:20,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-09 10:10:20,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:10:20,580 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;@17893b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:10:20,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-09 10:10:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 10:10:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:10:20,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:20,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:10:20,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-09 10:10:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859716376] [2024-11-09 10:10:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:20,802 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:10:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859716376] [2024-11-09 10:10:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859716376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:10:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136700464] [2024-11-09 10:10:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:20,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:20,858 INFO L87 Difference]: Start difference. First operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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:10:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:21,544 INFO L93 Difference]: Finished difference Result 1062 states and 1236 transitions. [2024-11-09 10:10:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:21,549 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:10:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:21,562 INFO L225 Difference]: With dead ends: 1062 [2024-11-09 10:10:21,563 INFO L226 Difference]: Without dead ends: 1060 [2024-11-09 10:10:21,564 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:10:21,567 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 1101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:21,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 899 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:10:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-09 10:10:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-09 10:10:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 643 states have (on average 1.8911353032659408) internal successors, (1216), 1053 states have internal predecessors, (1216), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1234 transitions. [2024-11-09 10:10:21,625 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1234 transitions. Word has length 3 [2024-11-09 10:10:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:21,626 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1234 transitions. [2024-11-09 10:10:21,626 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:10:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1234 transitions. [2024-11-09 10:10:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:10:21,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:21,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:10:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:10:21,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-09 10:10:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268600832] [2024-11-09 10:10:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:21,713 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:10:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268600832] [2024-11-09 10:10:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268600832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:10:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216891377] [2024-11-09 10:10:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:21,716 INFO L87 Difference]: Start difference. First operand 1060 states and 1234 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:10:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:22,277 INFO L93 Difference]: Finished difference Result 1379 states and 1641 transitions. [2024-11-09 10:10:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:22,278 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:10:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:22,283 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:10:22,283 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:10:22,283 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:10:22,284 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 396 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:22,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1926 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:10:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:10:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1291. [2024-11-09 10:10:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 870 states have (on average 1.8517241379310345) internal successors, (1611), 1284 states have internal predecessors, (1611), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1639 transitions. [2024-11-09 10:10:22,333 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1639 transitions. Word has length 3 [2024-11-09 10:10:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:22,333 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1639 transitions. [2024-11-09 10:10:22,334 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:10:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1639 transitions. [2024-11-09 10:10:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:10:22,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:22,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:22,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:10:22,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:22,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-09 10:10:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:22,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124949065] [2024-11-09 10:10:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:22,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:22,582 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:10:22,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124949065] [2024-11-09 10:10:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124949065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183741710] [2024-11-09 10:10:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:22,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:10:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:10:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:10:22,583 INFO L87 Difference]: Start difference. First operand 1291 states and 1639 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:10:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:23,690 INFO L93 Difference]: Finished difference Result 1368 states and 1629 transitions. [2024-11-09 10:10:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:10:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-09 10:10:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:23,695 INFO L225 Difference]: With dead ends: 1368 [2024-11-09 10:10:23,696 INFO L226 Difference]: Without dead ends: 1368 [2024-11-09 10:10:23,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:10:23,697 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 2203 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:23,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 1195 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:10:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-09 10:10:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1048. [2024-11-09 10:10:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 643 states have (on average 1.8709175738724728) internal successors, (1203), 1041 states have internal predecessors, (1203), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1221 transitions. [2024-11-09 10:10:23,721 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1221 transitions. Word has length 7 [2024-11-09 10:10:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:23,722 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1221 transitions. [2024-11-09 10:10:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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:10:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1221 transitions. [2024-11-09 10:10:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:10:23,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:23,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:23,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:10:23,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:23,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-09 10:10:23,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989514792] [2024-11-09 10:10:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:10:23,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989514792] [2024-11-09 10:10:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989514792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:10:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840216756] [2024-11-09 10:10:23,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:23,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:23,800 INFO L87 Difference]: Start difference. First operand 1048 states and 1221 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:10:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:24,384 INFO L93 Difference]: Finished difference Result 1348 states and 1608 transitions. [2024-11-09 10:10:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:24,386 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:10:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:24,390 INFO L225 Difference]: With dead ends: 1348 [2024-11-09 10:10:24,390 INFO L226 Difference]: Without dead ends: 1348 [2024-11-09 10:10:24,391 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:10:24,392 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 867 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:24,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1764 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:10:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-09 10:10:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1023. [2024-11-09 10:10:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 643 states have (on average 1.8320373250388802) internal successors, (1178), 1016 states have internal predecessors, (1178), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1196 transitions. [2024-11-09 10:10:24,407 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1196 transitions. Word has length 8 [2024-11-09 10:10:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:24,407 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1196 transitions. [2024-11-09 10:10:24,407 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:10:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1196 transitions. [2024-11-09 10:10:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:10:24,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:24,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:10:24,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-09 10:10:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193834100] [2024-11-09 10:10:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:24,439 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:10:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193834100] [2024-11-09 10:10:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193834100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:10:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755245606] [2024-11-09 10:10:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:24,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:24,441 INFO L87 Difference]: Start difference. First operand 1023 states and 1196 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:10:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:24,952 INFO L93 Difference]: Finished difference Result 1296 states and 1557 transitions. [2024-11-09 10:10:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:24,952 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:10:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:24,956 INFO L225 Difference]: With dead ends: 1296 [2024-11-09 10:10:24,956 INFO L226 Difference]: Without dead ends: 1296 [2024-11-09 10:10:24,956 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:10:24,957 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 1075 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:24,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1491 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:10:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-09 10:10:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2024-11-09 10:10:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 643 states have (on average 1.7589424572317263) internal successors, (1131), 969 states have internal predecessors, (1131), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1149 transitions. [2024-11-09 10:10:24,972 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1149 transitions. Word has length 8 [2024-11-09 10:10:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:24,972 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1149 transitions. [2024-11-09 10:10:24,972 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:10:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1149 transitions. [2024-11-09 10:10:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 10:10:24,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:24,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:24,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:10:24,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1321547200, now seen corresponding path program 1 times [2024-11-09 10:10:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332776263] [2024-11-09 10:10:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:25,021 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:10:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332776263] [2024-11-09 10:10:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332776263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974492224] [2024-11-09 10:10:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:25,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:10:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:10:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:10:25,024 INFO L87 Difference]: Start difference. First operand 976 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:10:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:25,142 INFO L93 Difference]: Finished difference Result 1930 states and 2278 transitions. [2024-11-09 10:10:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:10:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-09 10:10:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:25,148 INFO L225 Difference]: With dead ends: 1930 [2024-11-09 10:10:25,148 INFO L226 Difference]: Without dead ends: 1930 [2024-11-09 10:10:25,149 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:10:25,149 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 1100 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:25,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3298 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:10:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-09 10:10:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 978. [2024-11-09 10:10:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 645 states have (on average 1.7565891472868218) internal successors, (1133), 971 states have internal predecessors, (1133), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1151 transitions. [2024-11-09 10:10:25,168 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1151 transitions. Word has length 10 [2024-11-09 10:10:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1151 transitions. [2024-11-09 10:10:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:10:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-09 10:10:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:10:25,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:25,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:25,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:10:25,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-09 10:10:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692145720] [2024-11-09 10:10:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:25,219 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:10:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:25,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692145720] [2024-11-09 10:10:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692145720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:25,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:25,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:10:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151211142] [2024-11-09 10:10:25,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:10:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:10:25,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:10:25,221 INFO L87 Difference]: Start difference. First operand 978 states and 1151 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:10:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:25,744 INFO L93 Difference]: Finished difference Result 1004 states and 1204 transitions. [2024-11-09 10:10:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:10:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-09 10:10:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:25,747 INFO L225 Difference]: With dead ends: 1004 [2024-11-09 10:10:25,747 INFO L226 Difference]: Without dead ends: 1004 [2024-11-09 10:10:25,748 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:10:25,748 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 1340 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:25,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1336 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:10:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-09 10:10:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 955. [2024-11-09 10:10:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 645 states have (on average 1.7209302325581395) internal successors, (1110), 948 states have internal predecessors, (1110), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1128 transitions. [2024-11-09 10:10:25,762 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1128 transitions. Word has length 18 [2024-11-09 10:10:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:25,762 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1128 transitions. [2024-11-09 10:10:25,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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:10:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1128 transitions. [2024-11-09 10:10:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:10:25,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:25,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:10:25,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash 183846335, now seen corresponding path program 1 times [2024-11-09 10:10:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:25,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434358093] [2024-11-09 10:10:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:25,836 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:10:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434358093] [2024-11-09 10:10:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434358093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:10:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429346134] [2024-11-09 10:10:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:25,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:25,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:25,839 INFO L87 Difference]: Start difference. First operand 955 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:10:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:25,859 INFO L93 Difference]: Finished difference Result 880 states and 1025 transitions. [2024-11-09 10:10:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-09 10:10:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:25,862 INFO L225 Difference]: With dead ends: 880 [2024-11-09 10:10:25,862 INFO L226 Difference]: Without dead ends: 880 [2024-11-09 10:10:25,862 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:10:25,863 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 61 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1953 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:10:25,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1953 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:10:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-09 10:10:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-11-09 10:10:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 582 states have (on average 1.7302405498281788) internal successors, (1007), 873 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1025 transitions. [2024-11-09 10:10:25,875 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1025 transitions. Word has length 18 [2024-11-09 10:10:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:25,875 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1025 transitions. [2024-11-09 10:10:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:10:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1025 transitions. [2024-11-09 10:10:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:10:25,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:25,876 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:10:25,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:10:25,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:25,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 582825947, now seen corresponding path program 1 times [2024-11-09 10:10:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113532987] [2024-11-09 10:10:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:25,923 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:10:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113532987] [2024-11-09 10:10:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113532987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089838168] [2024-11-09 10:10:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:10:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:10:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:10:25,925 INFO L87 Difference]: Start difference. First operand 880 states and 1025 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:10:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:25,978 INFO L93 Difference]: Finished difference Result 862 states and 1000 transitions. [2024-11-09 10:10:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:10:25,979 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:10:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:25,981 INFO L225 Difference]: With dead ends: 862 [2024-11-09 10:10:25,981 INFO L226 Difference]: Without dead ends: 862 [2024-11-09 10:10:25,982 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:10:25,982 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2876 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:10:25,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2876 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:10:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-09 10:10:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 859. [2024-11-09 10:10:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 568 states have (on average 1.7235915492957747) internal successors, (979), 852 states have internal predecessors, (979), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 997 transitions. [2024-11-09 10:10:25,995 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 997 transitions. Word has length 20 [2024-11-09 10:10:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 997 transitions. [2024-11-09 10:10:25,995 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:10:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 997 transitions. [2024-11-09 10:10:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:10:25,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:25,996 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] [2024-11-09 10:10:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:10:25,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1292750889, now seen corresponding path program 1 times [2024-11-09 10:10:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121525769] [2024-11-09 10:10:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:26,090 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:10:26,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:26,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121525769] [2024-11-09 10:10:26,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121525769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:26,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:26,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:10:26,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040889978] [2024-11-09 10:10:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:26,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:10:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:10:26,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:10:26,092 INFO L87 Difference]: Start difference. First operand 859 states and 997 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:10:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:26,677 INFO L93 Difference]: Finished difference Result 1315 states and 1572 transitions. [2024-11-09 10:10:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:10:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-09 10:10:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:26,681 INFO L225 Difference]: With dead ends: 1315 [2024-11-09 10:10:26,681 INFO L226 Difference]: Without dead ends: 1315 [2024-11-09 10:10:26,681 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:10:26,682 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 816 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:26,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1913 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:10:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-09 10:10:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 855. [2024-11-09 10:10:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.716549295774648) internal successors, (975), 848 states have internal predecessors, (975), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 993 transitions. [2024-11-09 10:10:26,695 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 993 transitions. Word has length 34 [2024-11-09 10:10:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:26,695 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 993 transitions. [2024-11-09 10:10:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:10:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 993 transitions. [2024-11-09 10:10:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:10:26,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:26,697 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] [2024-11-09 10:10:26,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:10:26,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 808848765, now seen corresponding path program 1 times [2024-11-09 10:10:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897398601] [2024-11-09 10:10:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:26,806 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:10:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897398601] [2024-11-09 10:10:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897398601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820669112] [2024-11-09 10:10:26,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:26,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:10:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:26,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:10:26,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:10:26,809 INFO L87 Difference]: Start difference. First operand 855 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:10:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:26,851 INFO L93 Difference]: Finished difference Result 855 states and 989 transitions. [2024-11-09 10:10:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:10:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-11-09 10:10:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:26,854 INFO L225 Difference]: With dead ends: 855 [2024-11-09 10:10:26,854 INFO L226 Difference]: Without dead ends: 855 [2024-11-09 10:10:26,855 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:10:26,855 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 21 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:26,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2858 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:10:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-09 10:10:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-09 10:10:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.7095070422535212) internal successors, (971), 848 states have internal predecessors, (971), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 10:10:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 989 transitions. [2024-11-09 10:10:26,868 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 989 transitions. Word has length 68 [2024-11-09 10:10:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:26,868 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 989 transitions. [2024-11-09 10:10:26,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:10:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 989 transitions. [2024-11-09 10:10:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:10:26,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:26,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:26,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:10:26,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -324916151, now seen corresponding path program 1 times [2024-11-09 10:10:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529044414] [2024-11-09 10:10:26,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:26,953 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:10:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529044414] [2024-11-09 10:10:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529044414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:10:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640500091] [2024-11-09 10:10:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:26,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:10:26,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:10:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:10:26,956 INFO L87 Difference]: Start difference. First operand 855 states and 989 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:10:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:27,005 INFO L93 Difference]: Finished difference Result 1194 states and 1432 transitions. [2024-11-09 10:10:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:10:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 10:10:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:27,009 INFO L225 Difference]: With dead ends: 1194 [2024-11-09 10:10:27,009 INFO L226 Difference]: Without dead ends: 1194 [2024-11-09 10:10:27,009 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:10:27,010 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 361 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:27,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:10:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-09 10:10:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1140. [2024-11-09 10:10:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 848 states have (on average 1.6521226415094339) internal successors, (1401), 1133 states have internal predecessors, (1401), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1429 transitions. [2024-11-09 10:10:27,024 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1429 transitions. Word has length 76 [2024-11-09 10:10:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:27,024 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1429 transitions. [2024-11-09 10:10:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:10:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1429 transitions. [2024-11-09 10:10:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:10:27,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:27,025 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] [2024-11-09 10:10:27,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:10:27,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783132, now seen corresponding path program 1 times [2024-11-09 10:10:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995619501] [2024-11-09 10:10:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:27,208 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:10:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995619501] [2024-11-09 10:10:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995619501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:27,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967382910] [2024-11-09 10:10:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:27,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:10:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:10:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:10:27,210 INFO L87 Difference]: Start difference. First operand 1140 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:10:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:27,742 INFO L93 Difference]: Finished difference Result 1139 states and 1428 transitions. [2024-11-09 10:10:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:10:27,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-09 10:10:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:27,746 INFO L225 Difference]: With dead ends: 1139 [2024-11-09 10:10:27,746 INFO L226 Difference]: Without dead ends: 1139 [2024-11-09 10:10:27,746 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:10:27,747 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:27,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2905 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:10:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-11-09 10:10:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-11-09 10:10:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 848 states have (on average 1.650943396226415) internal successors, (1400), 1132 states have internal predecessors, (1400), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-09 10:10:27,760 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 84 [2024-11-09 10:10:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:27,760 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-09 10:10:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:10:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-09 10:10:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:10:27,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:27,761 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] [2024-11-09 10:10:27,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:10:27,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:27,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783133, now seen corresponding path program 1 times [2024-11-09 10:10:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643806031] [2024-11-09 10:10:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:10:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643806031] [2024-11-09 10:10:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643806031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:10:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494875797] [2024-11-09 10:10:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:10:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:10:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:10:28,080 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:10:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:28,684 INFO L93 Difference]: Finished difference Result 1138 states and 1427 transitions. [2024-11-09 10:10:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:10:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-09 10:10:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:28,688 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 10:10:28,688 INFO L226 Difference]: Without dead ends: 1138 [2024-11-09 10:10:28,688 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:10:28,688 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 1 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:28,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:10:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-09 10:10:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-09 10:10:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6517119244391971) internal successors, (1399), 1131 states have internal predecessors, (1399), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1427 transitions. [2024-11-09 10:10:28,705 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1427 transitions. Word has length 84 [2024-11-09 10:10:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:28,705 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1427 transitions. [2024-11-09 10:10:28,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:10:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1427 transitions. [2024-11-09 10:10:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:10:28,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:28,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:28,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:10:28,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:28,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash 876623811, now seen corresponding path program 1 times [2024-11-09 10:10:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:28,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439900649] [2024-11-09 10:10:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:28,961 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:10:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439900649] [2024-11-09 10:10:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439900649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:10:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001277427] [2024-11-09 10:10:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:10:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:10:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:10:28,964 INFO L87 Difference]: Start difference. First operand 1138 states and 1427 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:29,773 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-09 10:10:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:10:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-09 10:10:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:29,777 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:10:29,777 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:10:29,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:10:29,778 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 17 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:29,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4453 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:10:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:10:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1144. [2024-11-09 10:10:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6502347417840375) internal successors, (1406), 1136 states have internal predecessors, (1406), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 10:10:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1437 transitions. [2024-11-09 10:10:29,791 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1437 transitions. Word has length 92 [2024-11-09 10:10:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:29,792 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1437 transitions. [2024-11-09 10:10:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1437 transitions. [2024-11-09 10:10:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:10:29,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:29,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:10:29,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash 876623812, now seen corresponding path program 1 times [2024-11-09 10:10:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785227800] [2024-11-09 10:10:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:30,216 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:10:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785227800] [2024-11-09 10:10:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785227800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:30,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:10:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216342293] [2024-11-09 10:10:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:30,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:10:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:10:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:10:30,218 INFO L87 Difference]: Start difference. First operand 1144 states and 1437 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:30,905 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2024-11-09 10:10:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:10:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-09 10:10:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:30,908 INFO L225 Difference]: With dead ends: 1144 [2024-11-09 10:10:30,908 INFO L226 Difference]: Without dead ends: 1144 [2024-11-09 10:10:30,909 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:10:30,909 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 18 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:30,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3665 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:10:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-09 10:10:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-09 10:10:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6490610328638498) internal successors, (1405), 1136 states have internal predecessors, (1405), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-09 10:10:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1436 transitions. [2024-11-09 10:10:30,924 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1436 transitions. Word has length 92 [2024-11-09 10:10:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:30,924 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1436 transitions. [2024-11-09 10:10:30,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1436 transitions. [2024-11-09 10:10:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:10:30,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:30,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:10:30,925 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:30,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1996735173, now seen corresponding path program 1 times [2024-11-09 10:10:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467500108] [2024-11-09 10:10:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:31,426 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:10:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467500108] [2024-11-09 10:10:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467500108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210615433] [2024-11-09 10:10:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:31,431 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:10:31,432 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:10:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:31,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:10:31,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:10:31,827 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:10:32,056 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:10:32,056 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:10:32,136 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:10:32,242 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:10:32,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:32,449 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:10:32,488 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:10:32,516 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:10:32,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:10:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210615433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:32,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:10:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:10:32,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196789821] [2024-11-09 10:10:32,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:10:32,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:10:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:10:32,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=322, Unknown=4, NotChecked=0, Total=380 [2024-11-09 10:10:32,566 INFO L87 Difference]: Start difference. First operand 1144 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:34,649 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-09 10:10:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:10:34,650 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-09 10:10:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:34,653 INFO L225 Difference]: With dead ends: 1151 [2024-11-09 10:10:34,653 INFO L226 Difference]: Without dead ends: 1151 [2024-11-09 10:10:34,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=508, Unknown=5, NotChecked=0, Total=600 [2024-11-09 10:10:34,654 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 876 mSDsluCounter, 6617 mSDsCounter, 0 mSdLazyCounter, 4388 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:34,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7243 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4388 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:10:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-09 10:10:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2024-11-09 10:10:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 856 states have (on average 1.6460280373831775) internal successors, (1409), 1139 states have internal predecessors, (1409), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1438 transitions. [2024-11-09 10:10:34,667 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1438 transitions. Word has length 93 [2024-11-09 10:10:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:34,667 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1438 transitions. [2024-11-09 10:10:34,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2024-11-09 10:10:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:10:34,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:34,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:34,687 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:10:34,869 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,SelfDestructingSolverStorable16 [2024-11-09 10:10:34,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:34,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1996735174, now seen corresponding path program 1 times [2024-11-09 10:10:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647087385] [2024-11-09 10:10:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:35,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:35,718 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:10:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647087385] [2024-11-09 10:10:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647087385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884386459] [2024-11-09 10:10:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:35,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:35,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:35,724 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:10:35,726 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:10:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:35,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:10:35,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:10:35,929 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:10:36,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:10:36,033 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:10:36,040 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:10:36,060 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:10:36,065 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:10:36,124 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:10:36,132 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:10:36,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:36,241 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:10:36,251 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:10:36,289 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:10:36,294 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:10:36,303 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:10:36,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:10:36,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_752 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:10:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884386459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:36,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:10:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-09 10:10:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145502341] [2024-11-09 10:10:36,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:10:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:10:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:36,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:10:36,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 10:10:36,434 INFO L87 Difference]: Start difference. First operand 1148 states and 1438 transitions. Second operand has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:38,682 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-09 10:10:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:10:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2024-11-09 10:10:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:38,685 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:10:38,686 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:10:38,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:10:38,686 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 874 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:38,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 4883 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:10:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:10:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1141. [2024-11-09 10:10:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 851 states have (on average 1.6474735605170387) internal successors, (1402), 1133 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1430 transitions. [2024-11-09 10:10:38,698 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1430 transitions. Word has length 93 [2024-11-09 10:10:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:38,698 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1430 transitions. [2024-11-09 10:10:38,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.846153846153847) internal successors, (141), 15 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1430 transitions. [2024-11-09 10:10:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:10:38,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:38,699 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:10:38,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:10:38,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 10:10:38,900 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:38,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2099433348, now seen corresponding path program 1 times [2024-11-09 10:10:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:38,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077244737] [2024-11-09 10:10:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:39,293 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:10:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077244737] [2024-11-09 10:10:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077244737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:10:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453821592] [2024-11-09 10:10:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:39,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:10:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:10:39,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:10:39,295 INFO L87 Difference]: Start difference. First operand 1141 states and 1430 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:41,030 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:10:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:10:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-09 10:10:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:41,034 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:10:41,034 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:10:41,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:10:41,034 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 910 mSDsluCounter, 6027 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 6653 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:41,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 6653 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:10:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:10:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1150. [2024-11-09 10:10:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6437718277066355) internal successors, (1412), 1141 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1441 transitions. [2024-11-09 10:10:41,048 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1441 transitions. Word has length 95 [2024-11-09 10:10:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1441 transitions. [2024-11-09 10:10:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1441 transitions. [2024-11-09 10:10:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:10:41,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:41,049 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:10:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:10:41,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2099433349, now seen corresponding path program 1 times [2024-11-09 10:10:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:41,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323522307] [2024-11-09 10:10:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:10:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323522307] [2024-11-09 10:10:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323522307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:10:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969944335] [2024-11-09 10:10:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:10:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:10:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:10:41,568 INFO L87 Difference]: Start difference. First operand 1150 states and 1441 transitions. Second operand has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:43,496 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:10:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:10:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-09 10:10:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:43,499 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:10:43,499 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:10:43,499 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:10:43,500 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 904 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:43,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 4887 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:10:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:10:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-09 10:10:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6426076833527357) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-09 10:10:43,514 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 95 [2024-11-09 10:10:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:43,514 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-09 10:10:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-09 10:10:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:10:43,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:43,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:43,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:10:43,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -558871230, now seen corresponding path program 1 times [2024-11-09 10:10:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921850590] [2024-11-09 10:10:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:44,051 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:10:44,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921850590] [2024-11-09 10:10:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921850590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697198910] [2024-11-09 10:10:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:44,054 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:10:44,062 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:10:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:44,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:10:44,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:10:44,269 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:10:44,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:10:44,374 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:10:44,404 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:10:44,467 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:10:44,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:44,562 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:10:44,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:44,638 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:10:44,650 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:10:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:10:44,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:10:44,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:10:44,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1042 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1042))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:10:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697198910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:44,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:10:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:10:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263928995] [2024-11-09 10:10:44,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:10:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:10:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:44,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:10:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=425, Unknown=11, NotChecked=86, Total=600 [2024-11-09 10:10:44,726 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:47,543 INFO L93 Difference]: Finished difference Result 1152 states and 1444 transitions. [2024-11-09 10:10:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:10:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:10:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:47,547 INFO L225 Difference]: With dead ends: 1152 [2024-11-09 10:10:47,547 INFO L226 Difference]: Without dead ends: 1152 [2024-11-09 10:10:47,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=593, Unknown=11, NotChecked=102, Total=812 [2024-11-09 10:10:47,549 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 869 mSDsluCounter, 9615 mSDsCounter, 0 mSdLazyCounter, 6158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 10240 SdHoareTripleChecker+Invalid, 6176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:47,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 10240 Invalid, 6176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6158 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:10:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-09 10:10:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1149. [2024-11-09 10:10:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 859 states have (on average 1.6414435389988358) internal successors, (1410), 1140 states have internal predecessors, (1410), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1439 transitions. [2024-11-09 10:10:47,563 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1439 transitions. Word has length 96 [2024-11-09 10:10:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:47,564 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1439 transitions. [2024-11-09 10:10:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1439 transitions. [2024-11-09 10:10:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:10:47,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:47,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:47,586 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:10:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:47,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -558871229, now seen corresponding path program 1 times [2024-11-09 10:10:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626614946] [2024-11-09 10:10:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:48,558 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:10:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626614946] [2024-11-09 10:10:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626614946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253227510] [2024-11-09 10:10:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:48,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:48,561 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:10:48,563 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:10:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:48,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:10:48,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:10:48,782 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:10:48,867 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:10:48,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:10:48,872 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:10:48,895 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:10:48,904 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:10:48,965 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:10:48,970 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:10:49,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:49,053 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:10:49,063 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:10:49,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:49,116 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:10:49,123 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:10:49,133 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:10:49,138 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:10:49,156 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:10:49,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:10:49,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1200) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1199 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-09 10:10:49,213 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1200) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1199 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-09 10:10:49,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1206) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1205))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1206) .cse1 v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:10:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253227510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:49,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:10:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 10:10:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957085932] [2024-11-09 10:10:49,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:10:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:10:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:10:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-09 10:10:49,263 INFO L87 Difference]: Start difference. First operand 1149 states and 1439 transitions. Second operand has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:51,921 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-09 10:10:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:10:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:10:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:51,925 INFO L225 Difference]: With dead ends: 1151 [2024-11-09 10:10:51,925 INFO L226 Difference]: Without dead ends: 1151 [2024-11-09 10:10:51,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-09 10:10:51,926 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 885 mSDsluCounter, 5800 mSDsCounter, 0 mSdLazyCounter, 5235 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 6428 SdHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:51,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 6428 Invalid, 5266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5235 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:10:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-09 10:10:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1139. [2024-11-09 10:10:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 851 states have (on average 1.645123384253819) internal successors, (1400), 1131 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:10:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-09 10:10:51,937 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 96 [2024-11-09 10:10:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-09 10:10:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.5) internal successors, (153), 20 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:10:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-09 10:10:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:10:51,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:51,938 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:10:51,953 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:10:52,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:52,139 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 905752394, now seen corresponding path program 1 times [2024-11-09 10:10:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4686092] [2024-11-09 10:10:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:52,567 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:10:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4686092] [2024-11-09 10:10:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4686092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:10:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140723723] [2024-11-09 10:10:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:10:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:10:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:10:52,569 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:54,109 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-09 10:10:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:10:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:10:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:54,112 INFO L225 Difference]: With dead ends: 1155 [2024-11-09 10:10:54,116 INFO L226 Difference]: Without dead ends: 1155 [2024-11-09 10:10:54,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:10:54,116 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 909 mSDsluCounter, 5419 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 6044 SdHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:54,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 6044 Invalid, 3655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:10:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-09 10:10:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1151. [2024-11-09 10:10:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6392111368909512) internal successors, (1413), 1142 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1442 transitions. [2024-11-09 10:10:54,128 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1442 transitions. Word has length 98 [2024-11-09 10:10:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1442 transitions. [2024-11-09 10:10:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1442 transitions. [2024-11-09 10:10:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:10:54,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:54,129 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:10:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:10:54,129 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:54,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 905752395, now seen corresponding path program 1 times [2024-11-09 10:10:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343229039] [2024-11-09 10:10:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:54,941 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:10:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343229039] [2024-11-09 10:10:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343229039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:10:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:10:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:10:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803321571] [2024-11-09 10:10:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:10:54,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:10:54,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:54,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:10:54,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:10:54,943 INFO L87 Difference]: Start difference. First operand 1151 states and 1442 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:10:56,562 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:10:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:10:56,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:10:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:10:56,566 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:10:56,566 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:10:56,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:10:56,567 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 893 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:10:56,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 3793 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3051 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:10:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:10:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-09 10:10:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6380510440835268) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:10:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-09 10:10:56,579 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 98 [2024-11-09 10:10:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:10:56,580 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-09 10:10:56,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:10:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-09 10:10:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:10:56,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:10:56,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:10:56,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:10:56,581 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:10:56,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:10:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2038927156, now seen corresponding path program 1 times [2024-11-09 10:10:56,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:10:56,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527165355] [2024-11-09 10:10:56,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:10:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:10:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:57,239 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:10:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:10:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527165355] [2024-11-09 10:10:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527165355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215250403] [2024-11-09 10:10:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:10:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:10:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:10:57,245 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:10:57,247 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:10:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:10:57,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:10:57,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:10:57,449 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:10:57,543 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:10:57,543 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:10:57,566 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:10:57,634 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:10:57,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:57,733 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:10:57,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:57,791 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:10:57,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:10:57,839 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:10:57,850 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:10:57,876 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:10:57,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:10:57,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:10:57,918 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:10:57,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:10:57,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215250403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:10:57,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:10:57,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:10:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873537296] [2024-11-09 10:10:57,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:10:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:10:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:10:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:10:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=540, Unknown=24, NotChecked=150, Total=812 [2024-11-09 10:10:57,979 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:11:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:00,715 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:11:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:11:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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 99 [2024-11-09 10:11:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:00,718 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:11:00,718 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:11:00,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=731, Unknown=25, NotChecked=174, Total=1056 [2024-11-09 10:11:00,719 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 868 mSDsluCounter, 9036 mSDsCounter, 0 mSdLazyCounter, 5753 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 9660 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:00,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 9660 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5753 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 10:11:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:11:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-09 10:11:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 862 states have (on average 1.636890951276102) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-09 10:11:00,728 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 99 [2024-11-09 10:11:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:00,728 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-09 10:11:00,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:11:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-09 10:11:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:11:00,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:00,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:00,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:00,932 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,SelfDestructingSolverStorable24 [2024-11-09 10:11:00,933 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2038927155, now seen corresponding path program 1 times [2024-11-09 10:11:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:00,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980265934] [2024-11-09 10:11:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:01,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:01,617 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:11:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:01,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980265934] [2024-11-09 10:11:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980265934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:01,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866180453] [2024-11-09 10:11:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:01,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:01,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:01,620 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:11:01,621 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:11:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:01,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:11:01,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:01,896 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:11:01,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:01,996 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:11:02,001 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:11:02,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:11:02,034 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:11:02,105 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:11:02,108 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:11:02,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:02,201 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:11:02,207 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:11:02,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:02,273 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:11:02,281 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:11:02,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:02,348 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:11:02,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:11:02,405 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 30 treesize of output 12 [2024-11-09 10:11:02,407 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:11:02,432 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:11:02,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:02,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1690))) (or (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)))))) is different from false [2024-11-09 10:11:02,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698) .cse5 v_ArrVal_1690))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1691))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1699))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1698) .cse8 v_ArrVal_1690))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1693 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))))) is different from false [2024-11-09 10:11:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866180453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:02,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-09 10:11:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039187986] [2024-11-09 10:11:02,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:02,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:11:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:11:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=696, Unknown=12, NotChecked=110, Total=930 [2024-11-09 10:11:02,758 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:11:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:05,161 INFO L93 Difference]: Finished difference Result 1152 states and 1444 transitions. [2024-11-09 10:11:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:11:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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 99 [2024-11-09 10:11:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:05,165 INFO L225 Difference]: With dead ends: 1152 [2024-11-09 10:11:05,165 INFO L226 Difference]: Without dead ends: 1152 [2024-11-09 10:11:05,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1068, Unknown=12, NotChecked=138, Total=1406 [2024-11-09 10:11:05,166 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 880 mSDsluCounter, 5199 mSDsCounter, 0 mSdLazyCounter, 4893 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 5826 SdHoareTripleChecker+Invalid, 4925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:05,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 5826 Invalid, 4925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4893 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:11:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-09 10:11:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1137. [2024-11-09 10:11:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 851 states have (on average 1.6427732079905992) internal successors, (1398), 1129 states have internal predecessors, (1398), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:11:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1426 transitions. [2024-11-09 10:11:05,180 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1426 transitions. Word has length 99 [2024-11-09 10:11:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1426 transitions. [2024-11-09 10:11:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:11:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1426 transitions. [2024-11-09 10:11:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:11:05,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:05,183 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:11:05,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:11:05,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 10:11:05,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2009297685, now seen corresponding path program 1 times [2024-11-09 10:11:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140939331] [2024-11-09 10:11:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140939331] [2024-11-09 10:11:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140939331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:11:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283210745] [2024-11-09 10:11:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:11:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:11:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:11:05,964 INFO L87 Difference]: Start difference. First operand 1137 states and 1426 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:11:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:07,790 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-09 10:11:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:11:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-09 10:11:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:07,794 INFO L225 Difference]: With dead ends: 1156 [2024-11-09 10:11:07,794 INFO L226 Difference]: Without dead ends: 1156 [2024-11-09 10:11:07,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-09 10:11:07,795 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 899 mSDsluCounter, 4860 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 5487 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:07,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 5487 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:11:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-09 10:11:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1152. [2024-11-09 10:11:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6346820809248555) internal successors, (1414), 1143 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1443 transitions. [2024-11-09 10:11:07,808 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1443 transitions. Word has length 101 [2024-11-09 10:11:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:07,808 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1443 transitions. [2024-11-09 10:11:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:11:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1443 transitions. [2024-11-09 10:11:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 10:11:07,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:07,809 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:11:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:11:07,810 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2009297684, now seen corresponding path program 1 times [2024-11-09 10:11:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207899203] [2024-11-09 10:11:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:08,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:08,715 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:11:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:08,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207899203] [2024-11-09 10:11:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207899203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:08,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:11:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870116968] [2024-11-09 10:11:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:08,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:11:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:08,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:11:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:11:08,718 INFO L87 Difference]: Start difference. First operand 1152 states and 1443 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:11:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:10,975 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-09 10:11:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:11:10,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-09 10:11:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:10,977 INFO L225 Difference]: With dead ends: 1155 [2024-11-09 10:11:10,977 INFO L226 Difference]: Without dead ends: 1155 [2024-11-09 10:11:10,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:11:10,978 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 895 mSDsluCounter, 4706 mSDsCounter, 0 mSdLazyCounter, 4364 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 5334 SdHoareTripleChecker+Invalid, 4390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:10,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 5334 Invalid, 4390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4364 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:11:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-09 10:11:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1152. [2024-11-09 10:11:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6335260115606935) internal successors, (1413), 1143 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1442 transitions. [2024-11-09 10:11:10,989 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1442 transitions. Word has length 101 [2024-11-09 10:11:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:10,990 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1442 transitions. [2024-11-09 10:11:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:11:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1442 transitions. [2024-11-09 10:11:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:11:10,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:10,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:10,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 10:11:10,991 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2044216361, now seen corresponding path program 1 times [2024-11-09 10:11:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405680981] [2024-11-09 10:11:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:11,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405680981] [2024-11-09 10:11:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405680981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295695354] [2024-11-09 10:11:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:11,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:11,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:11:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:11,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 10:11:11,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:11,791 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:11:11,882 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:11:11,882 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:11:11,904 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:11:11,962 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:11:12,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:12,105 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:11:12,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:12,190 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:11:12,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:12,242 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:11:12,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:12,290 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:11:12,303 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:11:12,332 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:11:12,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:12,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:11:12,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:11:12,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (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$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2035))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:11:12,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2034))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:11:12,537 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2039))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2034)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2036)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:11:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295695354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:12,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-09 10:11:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772111009] [2024-11-09 10:11:12,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:12,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:11:12,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:11:12,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=634, Unknown=18, NotChecked=280, Total=1056 [2024-11-09 10:11:12,540 INFO L87 Difference]: Start difference. First operand 1152 states and 1442 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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:11:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:15,522 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-09 10:11:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:11:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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 102 [2024-11-09 10:11:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:15,524 INFO L225 Difference]: With dead ends: 1154 [2024-11-09 10:11:15,526 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 10:11:15,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=841, Unknown=18, NotChecked=320, Total=1332 [2024-11-09 10:11:15,527 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 859 mSDsluCounter, 9581 mSDsCounter, 0 mSdLazyCounter, 6171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 10204 SdHoareTripleChecker+Invalid, 6189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:15,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 10204 Invalid, 6189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6171 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:11:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 10:11:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-09 10:11:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 865 states have (on average 1.6323699421965319) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-09 10:11:15,538 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 102 [2024-11-09 10:11:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-09 10:11:15,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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:11:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-09 10:11:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:11:15,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:15,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:15,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 10:11:15,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:15,740 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2044216362, now seen corresponding path program 1 times [2024-11-09 10:11:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512000748] [2024-11-09 10:11:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:16,757 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:11:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512000748] [2024-11-09 10:11:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512000748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258685673] [2024-11-09 10:11:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:16,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:16,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:16,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 10:11:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:16,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 10:11:16,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:16,993 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:11:17,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:11:17,077 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:11:17,083 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:11:17,093 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:11:17,096 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:11:17,137 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:11:17,139 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:11:17,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:17,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:11:17,225 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:11:17,289 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:17,289 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:11:17,298 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:11:17,372 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:17,372 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:11:17,377 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:11:17,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:17,422 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:11:17,426 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:11:17,463 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:11:17,467 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:11:17,470 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:11:17,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:17,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2226 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:11:17,556 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2226 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:11:17,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2223) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2224))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2223) .cse1 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:11:17,623 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2223) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2224))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2223) .cse2 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-09 10:11:17,664 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2222))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2224))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2221) .cse0 v_ArrVal_2223) .cse1 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2222))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2221) .cse5 v_ArrVal_2223) (select (select (store .cse6 .cse5 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2226))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-09 10:11:17,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2222))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2221) .cse1 v_ArrVal_2223) (select (select (store .cse2 .cse1 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2226))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2222))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2224))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2221) .cse4 v_ArrVal_2223) .cse5 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-09 10:11:17,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2232))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2222))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2231) .cse0 v_ArrVal_2221) .cse1 v_ArrVal_2223) (select (select (store .cse2 .cse1 v_ArrVal_2224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2226))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2232))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2222))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2224))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2231) .cse5 v_ArrVal_2221) .cse6 v_ArrVal_2223) .cse7 v_ArrVal_2226) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-09 10:11:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258685673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:17,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2024-11-09 10:11:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022737246] [2024-11-09 10:11:17,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:11:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:11:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=474, Unknown=7, NotChecked=350, Total=930 [2024-11-09 10:11:17,793 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:18,996 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-09 10:11:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:11:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-09 10:11:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:18,999 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 10:11:18,999 INFO L226 Difference]: Without dead ends: 1153 [2024-11-09 10:11:19,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=852, Unknown=7, NotChecked=462, Total=1482 [2024-11-09 10:11:19,001 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 879 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:19,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3928 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:11:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-09 10:11:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1135. [2024-11-09 10:11:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 851 states have (on average 1.6404230317273796) internal successors, (1396), 1127 states have internal predecessors, (1396), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:11:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1424 transitions. [2024-11-09 10:11:19,018 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1424 transitions. Word has length 102 [2024-11-09 10:11:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:19,018 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1424 transitions. [2024-11-09 10:11:19,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.210526315789474) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:11:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1424 transitions. [2024-11-09 10:11:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 10:11:19,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:19,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:19,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 10:11:19,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:19,219 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:19,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash -851541523, now seen corresponding path program 1 times [2024-11-09 10:11:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:19,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851397660] [2024-11-09 10:11:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:19,954 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:11:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851397660] [2024-11-09 10:11:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851397660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:11:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315963715] [2024-11-09 10:11:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:19,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:11:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:11:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:11:19,956 INFO L87 Difference]: Start difference. First operand 1135 states and 1424 transitions. Second operand has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 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:11:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:21,272 INFO L93 Difference]: Finished difference Result 1158 states and 1450 transitions. [2024-11-09 10:11:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:11:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 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 105 [2024-11-09 10:11:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:21,274 INFO L225 Difference]: With dead ends: 1158 [2024-11-09 10:11:21,275 INFO L226 Difference]: Without dead ends: 1158 [2024-11-09 10:11:21,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:11:21,279 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 911 mSDsluCounter, 5382 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 6008 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:21,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 6008 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:11:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-09 10:11:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1154. [2024-11-09 10:11:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6294591484464902) internal successors, (1416), 1145 states have internal predecessors, (1416), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1445 transitions. [2024-11-09 10:11:21,295 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1445 transitions. Word has length 105 [2024-11-09 10:11:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1445 transitions. [2024-11-09 10:11:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 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:11:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1445 transitions. [2024-11-09 10:11:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 10:11:21,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:21,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:21,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 10:11:21,297 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:21,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -851541522, now seen corresponding path program 1 times [2024-11-09 10:11:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33725911] [2024-11-09 10:11:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:22,428 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:11:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33725911] [2024-11-09 10:11:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33725911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:11:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:11:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:11:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150371575] [2024-11-09 10:11:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:11:22,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:11:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:11:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:11:22,432 INFO L87 Difference]: Start difference. First operand 1154 states and 1445 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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:11:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:25,353 INFO L93 Difference]: Finished difference Result 1157 states and 1449 transitions. [2024-11-09 10:11:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:11:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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 105 [2024-11-09 10:11:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:25,356 INFO L225 Difference]: With dead ends: 1157 [2024-11-09 10:11:25,356 INFO L226 Difference]: Without dead ends: 1157 [2024-11-09 10:11:25,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-09 10:11:25,358 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 893 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 4693 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:25,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 6033 Invalid, 4715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4693 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 10:11:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-09 10:11:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1154. [2024-11-09 10:11:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6283084004602992) internal successors, (1415), 1145 states have internal predecessors, (1415), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1444 transitions. [2024-11-09 10:11:25,391 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1444 transitions. Word has length 105 [2024-11-09 10:11:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:25,392 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1444 transitions. [2024-11-09 10:11:25,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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:11:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1444 transitions. [2024-11-09 10:11:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:11:25,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:25,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 10:11:25,394 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1886361045, now seen corresponding path program 1 times [2024-11-09 10:11:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975232460] [2024-11-09 10:11:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:26,425 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:11:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975232460] [2024-11-09 10:11:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975232460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350600157] [2024-11-09 10:11:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:26,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:26,428 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:26,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:11:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:26,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:11:26,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:26,676 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:11:26,754 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:11:26,754 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:11:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:11:26,835 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:11:26,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:26,926 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:11:26,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:26,986 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:11:27,030 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:27,031 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:11:27,075 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:27,075 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:11:27,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:27,121 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:11:27,130 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:11:27,176 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-09 10:11:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-09 10:11:27,181 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:11:27,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350600157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:27,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-09 10:11:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767532247] [2024-11-09 10:11:27,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 10:11:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 10:11:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1163, Unknown=55, NotChecked=0, Total=1406 [2024-11-09 10:11:27,806 INFO L87 Difference]: Start difference. First operand 1154 states and 1444 transitions. Second operand has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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:11:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:11:30,446 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-09 10:11:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:11:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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 106 [2024-11-09 10:11:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:11:30,449 INFO L225 Difference]: With dead ends: 1156 [2024-11-09 10:11:30,449 INFO L226 Difference]: Without dead ends: 1156 [2024-11-09 10:11:30,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1447, Unknown=55, NotChecked=0, Total=1722 [2024-11-09 10:11:30,450 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 856 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 8407 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:11:30,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 8407 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:11:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-09 10:11:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2024-11-09 10:11:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 869 states have (on average 1.6271576524741083) internal successors, (1414), 1144 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:11:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1443 transitions. [2024-11-09 10:11:30,461 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1443 transitions. Word has length 106 [2024-11-09 10:11:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:11:30,461 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1443 transitions. [2024-11-09 10:11:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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:11:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1443 transitions. [2024-11-09 10:11:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:11:30,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:11:30,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:11:30,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 10:11:30,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:30,667 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-09 10:11:30,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:11:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1886361044, now seen corresponding path program 1 times [2024-11-09 10:11:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:11:30,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481228502] [2024-11-09 10:11:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:11:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 10:11:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:31,942 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:11:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:11:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481228502] [2024-11-09 10:11:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481228502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071893759] [2024-11-09 10:11:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:11:31,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:11:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:11:31,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:11:31,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 10:11:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:11:32,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 10:11:32,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:11:32,278 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:11:32,369 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:11:32,384 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:11:32,385 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:11:32,431 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:11:32,436 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:11:32,553 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 33 treesize of output 15 [2024-11-09 10:11:32,557 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:11:32,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:32,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:11:32,740 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:11:32,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:32,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:11:32,870 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:11:32,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:11:32,961 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:11:33,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:33,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:11:33,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:11:33,146 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:11:33,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:11:33,151 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:11:33,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-09 10:11:33,181 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:11:33,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:11:33,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:11:33,248 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 10:11:33,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 10:11:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:11:33,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:11:34,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2807))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2808) .cse1 v_ArrVal_2809) (select (select (store .cse2 .cse1 v_ArrVal_2810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2811 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2813 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2807))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2810))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2808) .cse4 v_ArrVal_2809) .cse5 v_ArrVal_2812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2813) (select (select (store .cse6 .cse5 v_ArrVal_2811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-09 10:11:43,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2807 (Array Int Int)) (v_ArrVal_2806 (Array Int Int)) (v_ArrVal_2805 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2819))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2806))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2807))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2818) .cse0 v_ArrVal_2805) .cse1 v_ArrVal_2808) .cse2 v_ArrVal_2809) (select (select (store .cse3 .cse2 v_ArrVal_2810) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2812))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2812 (Array Int Int)) (v_ArrVal_2811 (Array Int Int)) (v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2807 (Array Int Int)) (v_ArrVal_2806 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2805 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2813 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2819))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2806))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2807))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2810))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2818) .cse7 v_ArrVal_2805) .cse8 v_ArrVal_2808) .cse9 v_ArrVal_2809) .cse10 v_ArrVal_2812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2813) (select (select (store .cse11 .cse10 v_ArrVal_2811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-09 10:11:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071893759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:11:43,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:11:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-09 10:11:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783080975] [2024-11-09 10:11:43,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:11:43,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 10:11:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:11:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 10:11:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1353, Unknown=45, NotChecked=154, Total=1722 [2024-11-09 10:11:43,458 INFO L87 Difference]: Start difference. First operand 1153 states and 1443 transitions. Second operand has 30 states, 27 states have (on average 6.407407407407407) internal successors, (173), 29 states have internal predecessors, (173), 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)