./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_JEN_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:42:35,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:42:35,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:42:35,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:42:35,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:42:35,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:42:35,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:42:35,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:42:35,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:42:35,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:42:35,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:42:35,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:42:35,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:42:35,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:42:35,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:42:35,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:42:35,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:42:35,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:42:35,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:42:35,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:42:35,472 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:42:35,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:42:35,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:42:35,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:42:35,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:42:35,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:42:35,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:42:35,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:42:35,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:42:35,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:42:35,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:42:35,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:42:35,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:42:35,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:42:35,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:42:35,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:42:35,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:42:35,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:42:35,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:42:35,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:42:35,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:42:35,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:42:35,479 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 -> 8a34048511216dfe9a14f70dd929fd2de5a6eaf4560cb9e9e466dd0467a1d6d7 [2024-11-12 15:42:35,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:42:35,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:42:35,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:42:35,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:42:35,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:42:35,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-12 15:42:37,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:42:37,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:42:37,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-1.i [2024-11-12 15:42:37,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420278635/aca6a0c1125e498d8cdd30a2f60f1f01/FLAGb4a7041a7 [2024-11-12 15:42:37,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420278635/aca6a0c1125e498d8cdd30a2f60f1f01 [2024-11-12 15:42:37,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:42:37,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:42:37,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:37,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:42:37,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:42:37,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:37" (1/1) ... [2024-11-12 15:42:37,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b149d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:37, skipping insertion in model container [2024-11-12 15:42:37,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:42:37" (1/1) ... [2024-11-12 15:42:37,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:42:37,930 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-12 15:42:37,973 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-12 15:42:37,978 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-12 15:42:37,986 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-12 15:42:37,994 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-12 15:42:38,031 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-12 15:42:38,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:38,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:42:38,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:42:38,196 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:42:38,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38 WrapperNode [2024-11-12 15:42:38,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:42:38,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:42:38,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:42:38,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:42:38,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,290 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 849 [2024-11-12 15:42:38,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:42:38,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:42:38,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:42:38,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:42:38,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,356 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-12 15:42:38,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:42:38,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:42:38,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:42:38,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:42:38,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (1/1) ... [2024-11-12 15:42:38,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:42:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:42:38,467 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-12 15:42:38,481 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-12 15:42:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:42:38,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:42:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:42:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:42:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:42:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 15:42:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 15:42:38,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:42:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:42:38,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:42:38,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:42:38,765 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:42:38,801 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:42:40,317 INFO L? ?]: Removed 775 outVars from TransFormulas that were not future-live. [2024-11-12 15:42:40,317 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:42:40,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:42:40,364 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-12 15:42:40,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:42:40 BoogieIcfgContainer [2024-11-12 15:42:40,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:42:40,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:42:40,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:42:40,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:42:40,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:42:37" (1/3) ... [2024-11-12 15:42:40,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ede2601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:42:40, skipping insertion in model container [2024-11-12 15:42:40,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:42:38" (2/3) ... [2024-11-12 15:42:40,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ede2601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:42:40, skipping insertion in model container [2024-11-12 15:42:40,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:42:40" (3/3) ... [2024-11-12 15:42:40,376 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-1.i [2024-11-12 15:42:40,391 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:42:40,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-12 15:42:40,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:42:40,461 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;@4c87dbce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:42:40,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-12 15:42:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 15:42:40,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:40,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 15:42:40,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:40,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-12 15:42:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685111997] [2024-11-12 15:42:40,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:40,699 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-12 15:42:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:40,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685111997] [2024-11-12 15:42:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685111997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:40,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:40,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:42:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108006430] [2024-11-12 15:42:40,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:40,748 INFO L87 Difference]: Start difference. First operand has 758 states, 425 states have (on average 2.061176470588235) internal successors, (876), 752 states have internal predecessors, (876), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:41,479 INFO L93 Difference]: Finished difference Result 701 states and 809 transitions. [2024-11-12 15:42:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 15:42:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:41,504 INFO L225 Difference]: With dead ends: 701 [2024-11-12 15:42:41,505 INFO L226 Difference]: Without dead ends: 699 [2024-11-12 15:42:41,506 INFO L434 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-12 15:42:41,509 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:41,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 510 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 15:42:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-12 15:42:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2024-11-12 15:42:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 419 states have (on average 1.8568019093078758) internal successors, (778), 691 states have internal predecessors, (778), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 804 transitions. [2024-11-12 15:42:41,580 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 804 transitions. Word has length 5 [2024-11-12 15:42:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:41,581 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 804 transitions. [2024-11-12 15:42:41,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 804 transitions. [2024-11-12 15:42:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 15:42:41,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:41,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 15:42:41,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 15:42:41,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:41,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-12 15:42:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605002397] [2024-11-12 15:42:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:41,717 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-12 15:42:41,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:41,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605002397] [2024-11-12 15:42:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605002397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:41,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:41,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:42:41,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561245209] [2024-11-12 15:42:41,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:41,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:41,722 INFO L87 Difference]: Start difference. First operand 697 states and 804 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:42,194 INFO L93 Difference]: Finished difference Result 775 states and 888 transitions. [2024-11-12 15:42:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:42,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 15:42:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:42,199 INFO L225 Difference]: With dead ends: 775 [2024-11-12 15:42:42,199 INFO L226 Difference]: Without dead ends: 775 [2024-11-12 15:42:42,199 INFO L434 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-12 15:42:42,202 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 412 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:42,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 913 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 15:42:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-12 15:42:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 727. [2024-11-12 15:42:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 459 states have (on average 1.8453159041394336) internal successors, (847), 721 states have internal predecessors, (847), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 873 transitions. [2024-11-12 15:42:42,240 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 873 transitions. Word has length 5 [2024-11-12 15:42:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 873 transitions. [2024-11-12 15:42:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 873 transitions. [2024-11-12 15:42:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 15:42:42,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:42,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 15:42:42,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 15:42:42,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:42,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1423336739, now seen corresponding path program 1 times [2024-11-12 15:42:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:42,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102102865] [2024-11-12 15:42:42,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:42,291 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-12 15:42:42,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102102865] [2024-11-12 15:42:42,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102102865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:42:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386180794] [2024-11-12 15:42:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:42,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:42,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:42,295 INFO L87 Difference]: Start difference. First operand 727 states and 873 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:42,334 INFO L93 Difference]: Finished difference Result 1404 states and 1676 transitions. [2024-11-12 15:42:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 15:42:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:42,342 INFO L225 Difference]: With dead ends: 1404 [2024-11-12 15:42:42,342 INFO L226 Difference]: Without dead ends: 1404 [2024-11-12 15:42:42,345 INFO L434 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-12 15:42:42,361 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 717 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:42,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1578 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:42:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-12 15:42:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 728. [2024-11-12 15:42:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 460 states have (on average 1.8434782608695652) internal successors, (848), 722 states have internal predecessors, (848), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 874 transitions. [2024-11-12 15:42:42,389 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 874 transitions. Word has length 6 [2024-11-12 15:42:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:42,389 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 874 transitions. [2024-11-12 15:42:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 874 transitions. [2024-11-12 15:42:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:42:42,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:42,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:42,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 15:42:42,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-12 15:42:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391194275] [2024-11-12 15:42:42,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:42,499 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-12 15:42:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:42,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391194275] [2024-11-12 15:42:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391194275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:42,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:42:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238558828] [2024-11-12 15:42:42,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:42,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:42:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:42:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:42:42,503 INFO L87 Difference]: Start difference. First operand 728 states and 874 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:43,091 INFO L93 Difference]: Finished difference Result 754 states and 927 transitions. [2024-11-12 15:42:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:42:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 15:42:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:43,095 INFO L225 Difference]: With dead ends: 754 [2024-11-12 15:42:43,095 INFO L226 Difference]: Without dead ends: 754 [2024-11-12 15:42:43,096 INFO L434 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-12 15:42:43,097 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 965 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 15:42:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-12 15:42:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 705. [2024-11-12 15:42:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 460 states have (on average 1.7934782608695652) internal successors, (825), 699 states have internal predecessors, (825), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 851 transitions. [2024-11-12 15:42:43,114 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 851 transitions. Word has length 11 [2024-11-12 15:42:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:43,114 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 851 transitions. [2024-11-12 15:42:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 851 transitions. [2024-11-12 15:42:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:42:43,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:43,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:43,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 15:42:43,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-12 15:42:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:43,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386939068] [2024-11-12 15:42:43,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:43,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:43,190 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-12 15:42:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386939068] [2024-11-12 15:42:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386939068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:43,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:42:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950902986] [2024-11-12 15:42:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:43,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:43,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:43,194 INFO L87 Difference]: Start difference. First operand 705 states and 851 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:43,221 INFO L93 Difference]: Finished difference Result 630 states and 748 transitions. [2024-11-12 15:42:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 15:42:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:43,224 INFO L225 Difference]: With dead ends: 630 [2024-11-12 15:42:43,225 INFO L226 Difference]: Without dead ends: 630 [2024-11-12 15:42:43,225 INFO L434 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-12 15:42:43,227 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 61 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1259 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-12 15:42:43,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:42:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-12 15:42:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-12 15:42:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 397 states have (on average 1.818639798488665) internal successors, (722), 624 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-12 15:42:43,241 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 11 [2024-11-12 15:42:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:43,242 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-12 15:42:43,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-12 15:42:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 15:42:43,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:43,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 15:42:43,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-12 15:42:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294574596] [2024-11-12 15:42:43,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:43,306 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-12 15:42:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294574596] [2024-11-12 15:42:43,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294574596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:43,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:42:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765168341] [2024-11-12 15:42:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:42:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:42:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:42:43,309 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:43,373 INFO L93 Difference]: Finished difference Result 612 states and 723 transitions. [2024-11-12 15:42:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:42:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 15:42:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:43,378 INFO L225 Difference]: With dead ends: 612 [2024-11-12 15:42:43,378 INFO L226 Difference]: Without dead ends: 612 [2024-11-12 15:42:43,379 INFO L434 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-12 15:42:43,380 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 41 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1835 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-12 15:42:43,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1835 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:42:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-12 15:42:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-12 15:42:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 383 states have (on average 1.8120104438642297) internal successors, (694), 603 states have internal predecessors, (694), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2024-11-12 15:42:43,396 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 13 [2024-11-12 15:42:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2024-11-12 15:42:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2024-11-12 15:42:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 15:42:43,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:43,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:43,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 15:42:43,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:43,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-12 15:42:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227839113] [2024-11-12 15:42:43,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:43,603 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-12 15:42:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:43,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227839113] [2024-11-12 15:42:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227839113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:43,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:42:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103643036] [2024-11-12 15:42:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:43,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:42:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:42:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:42:43,607 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:44,145 INFO L93 Difference]: Finished difference Result 702 states and 807 transitions. [2024-11-12 15:42:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:42:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 15:42:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:44,149 INFO L225 Difference]: With dead ends: 702 [2024-11-12 15:42:44,150 INFO L226 Difference]: Without dead ends: 702 [2024-11-12 15:42:44,151 INFO L434 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-12 15:42:44,151 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 417 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1136 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 15:42:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-12 15:42:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 605. [2024-11-12 15:42:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.8015665796344646) internal successors, (690), 599 states have internal predecessors, (690), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 716 transitions. [2024-11-12 15:42:44,170 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 716 transitions. Word has length 27 [2024-11-12 15:42:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:44,171 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 716 transitions. [2024-11-12 15:42:44,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 716 transitions. [2024-11-12 15:42:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 15:42:44,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:44,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 15:42:44,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-12 15:42:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386889764] [2024-11-12 15:42:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:44,271 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-12 15:42:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386889764] [2024-11-12 15:42:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386889764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:42:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318240596] [2024-11-12 15:42:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:42:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:42:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:42:44,274 INFO L87 Difference]: Start difference. First operand 605 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:44,319 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2024-11-12 15:42:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:42:44,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-12 15:42:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:44,322 INFO L225 Difference]: With dead ends: 605 [2024-11-12 15:42:44,322 INFO L226 Difference]: Without dead ends: 605 [2024-11-12 15:42:44,322 INFO L434 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-12 15:42:44,323 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 21 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1817 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-12 15:42:44,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1817 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:42:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-12 15:42:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-12 15:42:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 383 states have (on average 1.7911227154046998) internal successors, (686), 599 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 712 transitions. [2024-11-12 15:42:44,334 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 712 transitions. Word has length 61 [2024-11-12 15:42:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 712 transitions. [2024-11-12 15:42:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 712 transitions. [2024-11-12 15:42:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 15:42:44,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:44,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 15:42:44,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:44,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-12 15:42:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576078240] [2024-11-12 15:42:44,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:44,478 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-12 15:42:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576078240] [2024-11-12 15:42:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576078240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:44,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:42:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970830401] [2024-11-12 15:42:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:42:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:44,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:42:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:42:44,481 INFO L87 Difference]: Start difference. First operand 605 states and 712 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:44,521 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2024-11-12 15:42:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:42:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 15:42:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:44,524 INFO L225 Difference]: With dead ends: 697 [2024-11-12 15:42:44,524 INFO L226 Difference]: Without dead ends: 697 [2024-11-12 15:42:44,524 INFO L434 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-12 15:42:44,525 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 54 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:44,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1234 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:42:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-12 15:42:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-12 15:42:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 475 states have (on average 1.694736842105263) internal successors, (805), 691 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 831 transitions. [2024-11-12 15:42:44,537 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 831 transitions. Word has length 69 [2024-11-12 15:42:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:44,537 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 831 transitions. [2024-11-12 15:42:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 831 transitions. [2024-11-12 15:42:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 15:42:44,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:44,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:44,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 15:42:44,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:44,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-12 15:42:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903049119] [2024-11-12 15:42:44,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:45,061 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-12 15:42:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903049119] [2024-11-12 15:42:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903049119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:42:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772659063] [2024-11-12 15:42:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:42:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:42:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:42:45,067 INFO L87 Difference]: Start difference. First operand 697 states and 831 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:45,742 INFO L93 Difference]: Finished difference Result 659 states and 793 transitions. [2024-11-12 15:42:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:42:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-12 15:42:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:45,745 INFO L225 Difference]: With dead ends: 659 [2024-11-12 15:42:45,745 INFO L226 Difference]: Without dead ends: 659 [2024-11-12 15:42:45,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:42:45,746 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 914 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:45,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 782 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 15:42:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-12 15:42:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 619. [2024-11-12 15:42:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 435 states have (on average 1.5816091954022988) internal successors, (688), 613 states have internal predecessors, (688), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 714 transitions. [2024-11-12 15:42:45,759 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 714 transitions. Word has length 72 [2024-11-12 15:42:45,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:45,759 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 714 transitions. [2024-11-12 15:42:45,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 714 transitions. [2024-11-12 15:42:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 15:42:45,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:45,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:45,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 15:42:45,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-12 15:42:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482842526] [2024-11-12 15:42:45,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:45,997 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-12 15:42:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482842526] [2024-11-12 15:42:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482842526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:42:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173797198] [2024-11-12 15:42:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:45,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:42:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:42:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:42:46,000 INFO L87 Difference]: Start difference. First operand 619 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:46,477 INFO L93 Difference]: Finished difference Result 618 states and 713 transitions. [2024-11-12 15:42:46,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:42:46,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-12 15:42:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:46,480 INFO L225 Difference]: With dead ends: 618 [2024-11-12 15:42:46,480 INFO L226 Difference]: Without dead ends: 618 [2024-11-12 15:42:46,481 INFO L434 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-12 15:42:46,482 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:46,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1669 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 15:42:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-12 15:42:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2024-11-12 15:42:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 435 states have (on average 1.5793103448275863) internal successors, (687), 612 states have internal predecessors, (687), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-12 15:42:46,495 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 77 [2024-11-12 15:42:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:46,496 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-12 15:42:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-12 15:42:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 15:42:46,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:46,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 15:42:46,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-12 15:42:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47074833] [2024-11-12 15:42:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:46,949 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-12 15:42:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47074833] [2024-11-12 15:42:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47074833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:46,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:42:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687631306] [2024-11-12 15:42:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:42:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:42:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:42:46,953 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:47,487 INFO L93 Difference]: Finished difference Result 617 states and 712 transitions. [2024-11-12 15:42:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:42:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-12 15:42:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:47,489 INFO L225 Difference]: With dead ends: 617 [2024-11-12 15:42:47,489 INFO L226 Difference]: Without dead ends: 617 [2024-11-12 15:42:47,490 INFO L434 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-12 15:42:47,491 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1676 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 15:42:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-12 15:42:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-12 15:42:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 434 states have (on average 1.5806451612903225) internal successors, (686), 611 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 712 transitions. [2024-11-12 15:42:47,502 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 712 transitions. Word has length 77 [2024-11-12 15:42:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:47,503 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 712 transitions. [2024-11-12 15:42:47,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:42:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 712 transitions. [2024-11-12 15:42:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 15:42:47,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:47,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:47,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 15:42:47,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:47,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418123, now seen corresponding path program 1 times [2024-11-12 15:42:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710396687] [2024-11-12 15:42:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:47,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:47,791 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-12 15:42:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710396687] [2024-11-12 15:42:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710396687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:47,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:47,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:42:47,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549146147] [2024-11-12 15:42:47,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:47,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:42:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:47,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:42:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:42:47,795 INFO L87 Difference]: Start difference. First operand 617 states and 712 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:48,564 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-12 15:42:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 15:42:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-12 15:42:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:48,567 INFO L225 Difference]: With dead ends: 629 [2024-11-12 15:42:48,567 INFO L226 Difference]: Without dead ends: 629 [2024-11-12 15:42:48,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 15:42:48,568 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 16 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:48,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2460 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 15:42:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-12 15:42:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2024-11-12 15:42:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5785876993166288) internal successors, (693), 616 states have internal predecessors, (693), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-12 15:42:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2024-11-12 15:42:48,581 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 85 [2024-11-12 15:42:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:48,582 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2024-11-12 15:42:48,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2024-11-12 15:42:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 15:42:48,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:48,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 15:42:48,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1675418124, now seen corresponding path program 1 times [2024-11-12 15:42:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688382490] [2024-11-12 15:42:48,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:49,074 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-12 15:42:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:49,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688382490] [2024-11-12 15:42:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688382490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:42:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29139059] [2024-11-12 15:42:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:42:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:42:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:42:49,076 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:49,846 INFO L93 Difference]: Finished difference Result 623 states and 721 transitions. [2024-11-12 15:42:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:42:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-12 15:42:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:49,849 INFO L225 Difference]: With dead ends: 623 [2024-11-12 15:42:49,849 INFO L226 Difference]: Without dead ends: 623 [2024-11-12 15:42:49,849 INFO L434 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-12 15:42:49,850 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 11 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:49,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2496 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 15:42:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-12 15:42:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-12 15:42:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 439 states have (on average 1.5763097949886105) internal successors, (692), 616 states have internal predecessors, (692), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-12 15:42:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 721 transitions. [2024-11-12 15:42:49,863 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 721 transitions. Word has length 85 [2024-11-12 15:42:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 721 transitions. [2024-11-12 15:42:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 721 transitions. [2024-11-12 15:42:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 15:42:49,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:49,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 15:42:49,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216262, now seen corresponding path program 1 times [2024-11-12 15:42:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586471334] [2024-11-12 15:42:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:50,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:50,394 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-12 15:42:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586471334] [2024-11-12 15:42:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586471334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:42:50,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719062287] [2024-11-12 15:42:50,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:50,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:42:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:42:50,397 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-12 15:42:50,399 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-12 15:42:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:50,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 15:42:50,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:50,644 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-12 15:42:50,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:42:50,783 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-12 15:42:50,800 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-12 15:42:50,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:42:50,883 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-12 15:42:50,921 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-12 15:42:50,925 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-12 15:42:50,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:42:50,984 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-12 15:42:50,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 15:42:50,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-12 15:42:50,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719062287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:42:50,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:42:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-12 15:42:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141677839] [2024-11-12 15:42:50,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:42:50,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 15:42:50,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 15:42:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-12 15:42:50,999 INFO L87 Difference]: Start difference. First operand 623 states and 721 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:42:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:52,493 INFO L93 Difference]: Finished difference Result 622 states and 720 transitions. [2024-11-12 15:42:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:42:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-12 15:42:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:52,495 INFO L225 Difference]: With dead ends: 622 [2024-11-12 15:42:52,496 INFO L226 Difference]: Without dead ends: 622 [2024-11-12 15:42:52,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-12 15:42:52,498 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 511 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:52,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3309 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:42:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-12 15:42:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2024-11-12 15:42:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 439 states have (on average 1.5740318906605923) internal successors, (691), 615 states have internal predecessors, (691), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-12 15:42:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 720 transitions. [2024-11-12 15:42:52,511 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 720 transitions. Word has length 86 [2024-11-12 15:42:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:52,512 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 720 transitions. [2024-11-12 15:42:52,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:42:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 720 transitions. [2024-11-12 15:42:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 15:42:52,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:52,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:52,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:42:52,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 15:42:52,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:52,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1642216263, now seen corresponding path program 1 times [2024-11-12 15:42:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343052956] [2024-11-12 15:42:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:53,482 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-12 15:42:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343052956] [2024-11-12 15:42:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343052956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:42:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178068890] [2024-11-12 15:42:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:53,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:42:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:42:53,485 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-12 15:42:53,487 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-12 15:42:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:53,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 15:42:53,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:42:53,691 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-12 15:42:53,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:42:53,811 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-12 15:42:53,818 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-12 15:42:53,851 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-12 15:42:53,858 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-12 15:42:53,947 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-12 15:42:53,952 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-12 15:42:54,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:42:54,068 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-12 15:42:54,073 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-12 15:42:54,112 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-12 15:42:54,116 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-12 15:42:54,136 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-12 15:42:54,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:42:54,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_643 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-12 15:42:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178068890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:42:54,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:42:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-12 15:42:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531541561] [2024-11-12 15:42:54,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:42:54,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:42:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:54,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:42:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-12 15:42:54,256 INFO L87 Difference]: Start difference. First operand 622 states and 720 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:42:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:55,758 INFO L93 Difference]: Finished difference Result 629 states and 727 transitions. [2024-11-12 15:42:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 15:42:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-12 15:42:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:55,762 INFO L225 Difference]: With dead ends: 629 [2024-11-12 15:42:55,762 INFO L226 Difference]: Without dead ends: 629 [2024-11-12 15:42:55,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-12 15:42:55,764 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 513 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:55,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2927 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 15:42:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-12 15:42:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2024-11-12 15:42:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 438 states have (on average 1.5730593607305936) internal successors, (689), 613 states have internal predecessors, (689), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:42:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 715 transitions. [2024-11-12 15:42:55,778 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 715 transitions. Word has length 86 [2024-11-12 15:42:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:55,779 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 715 transitions. [2024-11-12 15:42:55,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 15:42:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 715 transitions. [2024-11-12 15:42:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-12 15:42:55,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:55,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:55,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 15:42:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 15:42:55,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:55,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 566960249, now seen corresponding path program 1 times [2024-11-12 15:42:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483546461] [2024-11-12 15:42:55,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:56,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:56,551 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-12 15:42:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483546461] [2024-11-12 15:42:56,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483546461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:56,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 15:42:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654476489] [2024-11-12 15:42:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:56,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:42:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:42:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:42:56,554 INFO L87 Difference]: Start difference. First operand 620 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:57,974 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-12 15:42:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 15:42:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-12 15:42:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:57,978 INFO L225 Difference]: With dead ends: 633 [2024-11-12 15:42:57,979 INFO L226 Difference]: Without dead ends: 633 [2024-11-12 15:42:57,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-12 15:42:57,979 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 526 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:57,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 3914 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:42:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-12 15:42:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2024-11-12 15:42:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5672645739910314) internal successors, (699), 621 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:42:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 726 transitions. [2024-11-12 15:42:57,993 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 726 transitions. Word has length 88 [2024-11-12 15:42:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:57,993 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 726 transitions. [2024-11-12 15:42:57,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 726 transitions. [2024-11-12 15:42:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-12 15:42:57,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:57,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:57,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 15:42:57,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 566960250, now seen corresponding path program 1 times [2024-11-12 15:42:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435013838] [2024-11-12 15:42:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:58,630 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-12 15:42:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:42:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435013838] [2024-11-12 15:42:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435013838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:42:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:42:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 15:42:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150143447] [2024-11-12 15:42:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:42:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 15:42:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:42:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 15:42:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-12 15:42:58,633 INFO L87 Difference]: Start difference. First operand 629 states and 726 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:42:59,512 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-12 15:42:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:42:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-12 15:42:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:42:59,515 INFO L225 Difference]: With dead ends: 632 [2024-11-12 15:42:59,515 INFO L226 Difference]: Without dead ends: 632 [2024-11-12 15:42:59,515 INFO L434 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-12 15:42:59,516 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 513 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:42:59,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1790 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 15:42:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-12 15:42:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-12 15:42:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 446 states have (on average 1.5650224215246638) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:42:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-12 15:42:59,525 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 88 [2024-11-12 15:42:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:42:59,526 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-12 15:42:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:42:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-12 15:42:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 15:42:59,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:42:59,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:42:59,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 15:42:59,527 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:42:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:42:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash -707202722, now seen corresponding path program 1 times [2024-11-12 15:42:59,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:42:59,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699494219] [2024-11-12 15:42:59,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:42:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:42:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:42:59,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:42:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:00,015 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-12 15:43:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699494219] [2024-11-12 15:43:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699494219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284415944] [2024-11-12 15:43:00,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:00,019 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-12 15:43:00,020 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-12 15:43:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:00,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 15:43:00,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:00,226 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-12 15:43:00,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:00,314 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-12 15:43:00,321 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-12 15:43:00,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:00,383 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-12 15:43:00,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:00,429 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-12 15:43:00,445 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-12 15:43:00,448 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-12 15:43:00,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:00,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-12 15:43:00,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_898) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-12 15:43:00,501 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-12 15:43:00,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-12 15:43:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284415944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:00,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-12 15:43:00,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91730289] [2024-11-12 15:43:00,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:00,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 15:43:00,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:00,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 15:43:00,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=6, NotChecked=66, Total=380 [2024-11-12 15:43:00,536 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:01,992 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-12 15:43:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:43:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-12 15:43:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:01,994 INFO L225 Difference]: With dead ends: 631 [2024-11-12 15:43:01,995 INFO L226 Difference]: Without dead ends: 631 [2024-11-12 15:43:01,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=543, Unknown=6, NotChecked=98, Total=756 [2024-11-12 15:43:01,996 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 495 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 4265 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:01,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 4265 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:43:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-12 15:43:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2024-11-12 15:43:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 446 states have (on average 1.562780269058296) internal successors, (697), 620 states have internal predecessors, (697), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 724 transitions. [2024-11-12 15:43:02,007 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 724 transitions. Word has length 89 [2024-11-12 15:43:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:02,007 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 724 transitions. [2024-11-12 15:43:02,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 724 transitions. [2024-11-12 15:43:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 15:43:02,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:02,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:02,027 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-12 15:43:02,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:02,213 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:02,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash -707202721, now seen corresponding path program 1 times [2024-11-12 15:43:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704382027] [2024-11-12 15:43:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:02,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:43:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704382027] [2024-11-12 15:43:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704382027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572596819] [2024-11-12 15:43:03,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:03,023 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-12 15:43:03,033 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-12 15:43:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:03,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 15:43:03,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:03,272 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-12 15:43:03,377 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-12 15:43:03,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:03,386 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-12 15:43:03,398 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-12 15:43:03,402 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-12 15:43:03,448 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-12 15:43:03,452 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-12 15:43:03,550 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:03,550 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-12 15:43:03,557 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-12 15:43:03,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:03,635 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-12 15:43:03,642 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-12 15:43:03,656 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-12 15:43:03,660 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-12 15:43:03,664 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-12 15:43:03,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:03,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-12 15:43:03,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1045 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-12 15:43:03,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1051) .cse1 v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-12 15:43:03,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572596819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:03,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:03,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-12 15:43:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349463599] [2024-11-12 15:43:03,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:03,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 15:43:03,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 15:43:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-12 15:43:03,787 INFO L87 Difference]: Start difference. First operand 628 states and 724 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:43:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:05,665 INFO L93 Difference]: Finished difference Result 630 states and 728 transitions. [2024-11-12 15:43:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:43:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-12 15:43:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:05,668 INFO L225 Difference]: With dead ends: 630 [2024-11-12 15:43:05,668 INFO L226 Difference]: Without dead ends: 630 [2024-11-12 15:43:05,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-12 15:43:05,669 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 502 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:05,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3016 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:43:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-12 15:43:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 618. [2024-11-12 15:43:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 438 states have (on average 1.5684931506849316) internal successors, (687), 611 states have internal predecessors, (687), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:43:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 713 transitions. [2024-11-12 15:43:05,694 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 713 transitions. Word has length 89 [2024-11-12 15:43:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:05,695 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 713 transitions. [2024-11-12 15:43:05,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 16 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:43:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 713 transitions. [2024-11-12 15:43:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 15:43:05,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:05,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:05,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:05,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:05,897 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985486, now seen corresponding path program 1 times [2024-11-12 15:43:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740866853] [2024-11-12 15:43:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:06,455 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-12 15:43:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740866853] [2024-11-12 15:43:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740866853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:06,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:06,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 15:43:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414493961] [2024-11-12 15:43:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:06,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 15:43:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 15:43:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-12 15:43:06,458 INFO L87 Difference]: Start difference. First operand 618 states and 713 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:07,531 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-12 15:43:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:43:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-12 15:43:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:07,534 INFO L225 Difference]: With dead ends: 634 [2024-11-12 15:43:07,534 INFO L226 Difference]: Without dead ends: 634 [2024-11-12 15:43:07,535 INFO L434 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-12 15:43:07,535 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 511 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:07,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2939 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 15:43:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-12 15:43:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2024-11-12 15:43:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.55902004454343) internal successors, (700), 622 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 727 transitions. [2024-11-12 15:43:07,546 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 727 transitions. Word has length 91 [2024-11-12 15:43:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:07,546 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 727 transitions. [2024-11-12 15:43:07,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 727 transitions. [2024-11-12 15:43:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 15:43:07,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:07,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 15:43:07,548 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:07,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1792985485, now seen corresponding path program 1 times [2024-11-12 15:43:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392436287] [2024-11-12 15:43:07,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:43:08,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392436287] [2024-11-12 15:43:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392436287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:08,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 15:43:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455194467] [2024-11-12 15:43:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 15:43:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 15:43:08,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 15:43:08,295 INFO L87 Difference]: Start difference. First operand 630 states and 727 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:09,517 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-12 15:43:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:43:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-12 15:43:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:09,520 INFO L225 Difference]: With dead ends: 633 [2024-11-12 15:43:09,520 INFO L226 Difference]: Without dead ends: 633 [2024-11-12 15:43:09,520 INFO L434 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-12 15:43:09,521 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 526 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:09,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2667 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 15:43:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-12 15:43:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-12 15:43:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 449 states have (on average 1.556792873051225) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-12 15:43:09,531 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 91 [2024-11-12 15:43:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:09,531 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-12 15:43:09,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-12 15:43:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 15:43:09,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:09,532 INFO L218 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-12 15:43:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 15:43:09,533 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:09,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:09,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092499, now seen corresponding path program 1 times [2024-11-12 15:43:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891207334] [2024-11-12 15:43:09,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:10,085 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-12 15:43:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891207334] [2024-11-12 15:43:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891207334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389001021] [2024-11-12 15:43:10,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:10,088 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-12 15:43:10,089 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-12 15:43:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:10,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 15:43:10,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:10,321 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-12 15:43:10,402 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:10,403 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-12 15:43:10,409 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-12 15:43:10,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:10,468 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-12 15:43:10,525 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:10,525 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-12 15:43:10,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:10,571 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-12 15:43:10,580 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-12 15:43:10,582 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-12 15:43:10,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:10,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1331 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-12 15:43:10,707 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-12 15:43:10,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-12 15:43:10,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1334))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1330)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-12 15:43:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389001021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:10,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-12 15:43:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394668669] [2024-11-12 15:43:10,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:43:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:43:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=368, Unknown=29, NotChecked=82, Total=552 [2024-11-12 15:43:10,718 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:12,116 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-12 15:43:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 15:43:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-12 15:43:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:12,119 INFO L225 Difference]: With dead ends: 632 [2024-11-12 15:43:12,119 INFO L226 Difference]: Without dead ends: 632 [2024-11-12 15:43:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=756, Unknown=36, NotChecked=118, Total=1056 [2024-11-12 15:43:12,120 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 497 mSDsluCounter, 3898 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:12,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4255 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:43:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-12 15:43:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2024-11-12 15:43:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 449 states have (on average 1.55456570155902) internal successors, (698), 621 states have internal predecessors, (698), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 725 transitions. [2024-11-12 15:43:12,128 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 725 transitions. Word has length 92 [2024-11-12 15:43:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:12,129 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 725 transitions. [2024-11-12 15:43:12,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.882352941176471) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 725 transitions. [2024-11-12 15:43:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 15:43:12,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:12,130 INFO L218 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-12 15:43:12,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 15:43:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-12 15:43:12,335 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1461092498, now seen corresponding path program 1 times [2024-11-12 15:43:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313488133] [2024-11-12 15:43:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:13,160 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-12 15:43:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313488133] [2024-11-12 15:43:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313488133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820959875] [2024-11-12 15:43:13,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:13,163 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-12 15:43:13,166 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-12 15:43:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:13,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 15:43:13,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:13,395 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-12 15:43:13,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:13,480 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-12 15:43:13,483 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-12 15:43:13,503 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-12 15:43:13,506 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-12 15:43:13,580 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-12 15:43:13,584 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-12 15:43:13,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:13,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-12 15:43:13,678 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-12 15:43:13,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:13,734 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-12 15:43:13,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-12 15:43:13,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:13,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 62 treesize of output 57 [2024-11-12 15:43:13,796 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-12 15:43:13,836 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-12 15:43:13,842 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 30 treesize of output 12 [2024-11-12 15:43:13,865 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-12 15:43:13,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:14,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))))) is different from false [2024-11-12 15:43:14,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1489 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))))) is different from false [2024-11-12 15:43:14,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse5 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1490))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1497))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1498) .cse8 v_ArrVal_1489))) (or (forall ((v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))))) is different from false [2024-11-12 15:43:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820959875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:14,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-12 15:43:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536622675] [2024-11-12 15:43:14,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 15:43:14,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 15:43:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2024-11-12 15:43:14,149 INFO L87 Difference]: Start difference. First operand 629 states and 725 transitions. Second operand has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 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-12 15:43:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:16,011 INFO L93 Difference]: Finished difference Result 631 states and 729 transitions. [2024-11-12 15:43:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:43:16,012 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 92 [2024-11-12 15:43:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:16,014 INFO L225 Difference]: With dead ends: 631 [2024-11-12 15:43:16,014 INFO L226 Difference]: Without dead ends: 631 [2024-11-12 15:43:16,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1023, Unknown=3, NotChecked=204, Total=1406 [2024-11-12 15:43:16,015 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 515 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:16,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 3058 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:43:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-12 15:43:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 616. [2024-11-12 15:43:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 609 states have internal predecessors, (685), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:43:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 711 transitions. [2024-11-12 15:43:16,024 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 711 transitions. Word has length 92 [2024-11-12 15:43:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:16,025 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 711 transitions. [2024-11-12 15:43:16,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.0) internal successors, (147), 23 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-12 15:43:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 711 transitions. [2024-11-12 15:43:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 15:43:16,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:16,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:16,045 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-12 15:43:16,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:16,227 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265600, now seen corresponding path program 1 times [2024-11-12 15:43:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793180635] [2024-11-12 15:43:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:16,779 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-12 15:43:16,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:16,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793180635] [2024-11-12 15:43:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793180635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 15:43:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360474403] [2024-11-12 15:43:16,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:16,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 15:43:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:16,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 15:43:16,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-12 15:43:16,781 INFO L87 Difference]: Start difference. First operand 616 states and 711 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:17,882 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-12 15:43:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 15:43:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-12 15:43:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:17,885 INFO L225 Difference]: With dead ends: 635 [2024-11-12 15:43:17,885 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 15:43:17,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-12 15:43:17,886 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 516 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:17,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 3287 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 15:43:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 15:43:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-12 15:43:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 623 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 728 transitions. [2024-11-12 15:43:17,897 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 728 transitions. Word has length 94 [2024-11-12 15:43:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:17,897 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 728 transitions. [2024-11-12 15:43:17,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 728 transitions. [2024-11-12 15:43:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 15:43:17,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:17,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:43:17,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 15:43:17,899 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:17,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1678265601, now seen corresponding path program 1 times [2024-11-12 15:43:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379694772] [2024-11-12 15:43:17,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:18,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:18,588 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-12 15:43:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:18,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379694772] [2024-11-12 15:43:18,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379694772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:18,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 15:43:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175795308] [2024-11-12 15:43:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:43:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:43:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:43:18,590 INFO L87 Difference]: Start difference. First operand 631 states and 728 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:20,081 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-12 15:43:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 15:43:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-12 15:43:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:20,083 INFO L225 Difference]: With dead ends: 634 [2024-11-12 15:43:20,083 INFO L226 Difference]: Without dead ends: 634 [2024-11-12 15:43:20,083 INFO L434 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-12 15:43:20,084 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 527 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:20,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2880 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 15:43:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-12 15:43:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-12 15:43:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 452 states have (on average 1.5486725663716814) internal successors, (700), 623 states have internal predecessors, (700), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 727 transitions. [2024-11-12 15:43:20,094 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 727 transitions. Word has length 94 [2024-11-12 15:43:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:20,094 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 727 transitions. [2024-11-12 15:43:20,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 15:43:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 727 transitions. [2024-11-12 15:43:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 15:43:20,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:20,096 INFO L218 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-12 15:43:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 15:43:20,096 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525925, now seen corresponding path program 1 times [2024-11-12 15:43:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014600330] [2024-11-12 15:43:20,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:20,642 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-12 15:43:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014600330] [2024-11-12 15:43:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014600330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106801057] [2024-11-12 15:43:20,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:20,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:20,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:20,644 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-12 15:43:20,645 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-12 15:43:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:20,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 15:43:20,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:20,857 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-12 15:43:20,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:20,929 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-12 15:43:20,939 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-12 15:43:21,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:21,014 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-12 15:43:21,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:21,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 15:43:21,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:21,096 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-12 15:43:21,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:21,130 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-12 15:43:21,138 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-12 15:43:21,140 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-12 15:43:21,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:21,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1803) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-12 15:43:21,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-12 15:43:21,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-12 15:43:21,299 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-12 15:43:21,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-12 15:43:21,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1806))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1803)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-12 15:43:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106801057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:21,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-12 15:43:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701890278] [2024-11-12 15:43:21,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 15:43:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:21,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 15:43:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=534, Unknown=35, NotChecked=204, Total=870 [2024-11-12 15:43:21,310 INFO L87 Difference]: Start difference. First operand 631 states and 727 transitions. Second operand has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 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-12 15:43:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:22,949 INFO L93 Difference]: Finished difference Result 633 states and 731 transitions. [2024-11-12 15:43:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 15:43:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-12 15:43:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:22,952 INFO L225 Difference]: With dead ends: 633 [2024-11-12 15:43:22,952 INFO L226 Difference]: Without dead ends: 633 [2024-11-12 15:43:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=1051, Unknown=41, NotChecked=284, Total=1560 [2024-11-12 15:43:22,953 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 497 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:22,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4864 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3831 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:43:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-12 15:43:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2024-11-12 15:43:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 452 states have (on average 1.5464601769911503) internal successors, (699), 622 states have internal predecessors, (699), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 726 transitions. [2024-11-12 15:43:22,961 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 726 transitions. Word has length 95 [2024-11-12 15:43:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 726 transitions. [2024-11-12 15:43:22,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.25) internal successors, (145), 22 states have internal predecessors, (145), 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-12 15:43:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 726 transitions. [2024-11-12 15:43:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 15:43:22,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:22,962 INFO L218 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-12 15:43:22,981 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-12 15:43:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:23,167 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2087525926, now seen corresponding path program 1 times [2024-11-12 15:43:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994548] [2024-11-12 15:43:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:43:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994548] [2024-11-12 15:43:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512480040] [2024-11-12 15:43:24,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:24,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:24,085 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-12 15:43:24,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 15:43:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:24,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 15:43:24,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:24,304 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-12 15:43:24,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:24,373 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-12 15:43:24,378 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-12 15:43:24,383 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-12 15:43:24,387 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-12 15:43:24,420 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-12 15:43:24,423 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-12 15:43:24,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:24,496 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-12 15:43:24,502 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-12 15:43:24,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:24,556 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-12 15:43:24,562 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-12 15:43:24,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:24,610 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-12 15:43:24,614 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-12 15:43:24,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:24,658 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-12 15:43:24,663 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-12 15:43:24,677 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-12 15:43:24,682 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-12 15:43:24,683 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-12 15:43:24,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:24,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-12 15:43:24,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1978 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-12 15:43:24,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1976) .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-12 15:43:24,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) .cse1 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1976) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-12 15:43:24,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974) .cse0 v_ArrVal_1976) (select (select (store .cse1 .cse0 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1975))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1974) .cse3 v_ArrVal_1976) .cse4 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-12 15:43:24,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1973))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1975))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1974) .cse4 v_ArrVal_1976) .cse5 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-12 15:43:24,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse0 v_ArrVal_1974) .cse1 v_ArrVal_1976) (select (select (store .cse2 .cse1 v_ArrVal_1975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1978))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1973))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1975))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1984) .cse5 v_ArrVal_1974) .cse6 v_ArrVal_1976) .cse7 v_ArrVal_1978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-12 15:43:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512480040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:24,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 20 [2024-11-12 15:43:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667553665] [2024-11-12 15:43:24,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:24,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 15:43:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 15:43:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=439, Unknown=7, NotChecked=336, Total=870 [2024-11-12 15:43:24,867 INFO L87 Difference]: Start difference. First operand 630 states and 726 transitions. Second operand has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:43:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:26,309 INFO L93 Difference]: Finished difference Result 632 states and 730 transitions. [2024-11-12 15:43:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 15:43:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-12 15:43:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:26,312 INFO L225 Difference]: With dead ends: 632 [2024-11-12 15:43:26,312 INFO L226 Difference]: Without dead ends: 632 [2024-11-12 15:43:26,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=917, Unknown=7, NotChecked=476, Total=1560 [2024-11-12 15:43:26,313 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 498 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:26,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2282 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:43:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-12 15:43:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 614. [2024-11-12 15:43:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 438 states have (on average 1.5593607305936072) internal successors, (683), 607 states have internal predecessors, (683), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:43:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 709 transitions. [2024-11-12 15:43:26,324 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 709 transitions. Word has length 95 [2024-11-12 15:43:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:26,324 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 709 transitions. [2024-11-12 15:43:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.526315789473684) internal successors, (143), 20 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 15:43:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 709 transitions. [2024-11-12 15:43:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 15:43:26,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:26,325 INFO L218 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-12 15:43:26,343 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-12 15:43:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-12 15:43:26,526 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366978, now seen corresponding path program 1 times [2024-11-12 15:43:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567829742] [2024-11-12 15:43:26,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:27,249 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-12 15:43:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567829742] [2024-11-12 15:43:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567829742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 15:43:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105468832] [2024-11-12 15:43:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 15:43:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 15:43:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-12 15:43:27,252 INFO L87 Difference]: Start difference. First operand 614 states and 709 transitions. Second operand has 15 states, 14 states have (on average 6.857142857142857) 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-12 15:43:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:28,472 INFO L93 Difference]: Finished difference Result 637 states and 735 transitions. [2024-11-12 15:43:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 15:43:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.857142857142857) 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-12 15:43:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:28,474 INFO L225 Difference]: With dead ends: 637 [2024-11-12 15:43:28,475 INFO L226 Difference]: Without dead ends: 637 [2024-11-12 15:43:28,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-12 15:43:28,475 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 511 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:28,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3566 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 15:43:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-12 15:43:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-11-12 15:43:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5416666666666667) internal successors, (703), 625 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 730 transitions. [2024-11-12 15:43:28,483 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 730 transitions. Word has length 98 [2024-11-12 15:43:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:28,484 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 730 transitions. [2024-11-12 15:43:28,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.857142857142857) 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-12 15:43:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 730 transitions. [2024-11-12 15:43:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 15:43:28,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:28,489 INFO L218 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-12 15:43:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 15:43:28,489 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1581366979, now seen corresponding path program 1 times [2024-11-12 15:43:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527286911] [2024-11-12 15:43:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:29,444 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-12 15:43:29,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527286911] [2024-11-12 15:43:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527286911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:29,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 15:43:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130545487] [2024-11-12 15:43:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:29,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 15:43:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 15:43:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-12 15:43:29,446 INFO L87 Difference]: Start difference. First operand 633 states and 730 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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-12 15:43:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:30,901 INFO L93 Difference]: Finished difference Result 636 states and 734 transitions. [2024-11-12 15:43:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 15:43:30,901 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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-12 15:43:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:30,903 INFO L225 Difference]: With dead ends: 636 [2024-11-12 15:43:30,903 INFO L226 Difference]: Without dead ends: 636 [2024-11-12 15:43:30,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-12 15:43:30,905 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 510 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:30,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2809 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:43:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-12 15:43:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-11-12 15:43:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 456 states have (on average 1.5394736842105263) internal successors, (702), 625 states have internal predecessors, (702), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 729 transitions. [2024-11-12 15:43:30,912 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 729 transitions. Word has length 98 [2024-11-12 15:43:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:30,913 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 729 transitions. [2024-11-12 15:43:30,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 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-12 15:43:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 729 transitions. [2024-11-12 15:43:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 15:43:30,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:30,914 INFO L218 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-12 15:43:30,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 15:43:30,914 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 668956007, now seen corresponding path program 1 times [2024-11-12 15:43:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705375338] [2024-11-12 15:43:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:31,579 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-12 15:43:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705375338] [2024-11-12 15:43:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705375338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655443150] [2024-11-12 15:43:31,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:31,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:31,582 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-12 15:43:31,583 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-12 15:43:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:31,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 15:43:31,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:31,828 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-12 15:43:31,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:31,908 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-12 15:43:31,927 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-12 15:43:32,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:32,023 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-12 15:43:32,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:32,068 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-12 15:43:32,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:32,113 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-12 15:43:32,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:32,158 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-12 15:43:32,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:32,205 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-12 15:43:32,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-12 15:43:32,235 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 15:43:32,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-12 15:43:32,238 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-12 15:43:32,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:32,780 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-12 15:43:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-12 15:43:32,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2326 (Array Int Int)) (v_ArrVal_2322 (Array Int Int)) (v_ArrVal_2321 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2326))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2319)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2320)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2321)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2322)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-12 15:43:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655443150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:32,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-11-12 15:43:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529515700] [2024-11-12 15:43:32,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 15:43:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 15:43:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1050, Unknown=44, NotChecked=68, Total=1332 [2024-11-12 15:43:32,802 INFO L87 Difference]: Start difference. First operand 633 states and 729 transitions. Second operand has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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-12 15:43:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:34,029 INFO L93 Difference]: Finished difference Result 635 states and 733 transitions. [2024-11-12 15:43:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 15:43:34,030 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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 99 [2024-11-12 15:43:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:34,032 INFO L225 Difference]: With dead ends: 635 [2024-11-12 15:43:34,032 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 15:43:34,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1659, Unknown=44, NotChecked=86, Total=2070 [2024-11-12 15:43:34,033 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 506 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:34,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3257 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 15:43:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 15:43:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2024-11-12 15:43:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 456 states have (on average 1.537280701754386) internal successors, (701), 624 states have internal predecessors, (701), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 728 transitions. [2024-11-12 15:43:34,039 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 728 transitions. Word has length 99 [2024-11-12 15:43:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:34,039 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 728 transitions. [2024-11-12 15:43:34,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.739130434782608) internal successors, (155), 25 states have internal predecessors, (155), 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-12 15:43:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 728 transitions. [2024-11-12 15:43:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 15:43:34,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:34,040 INFO L218 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-12 15:43:34,056 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-12 15:43:34,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:34,241 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash 668956008, now seen corresponding path program 1 times [2024-11-12 15:43:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21633859] [2024-11-12 15:43:34,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:35,210 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-12 15:43:35,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:35,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21633859] [2024-11-12 15:43:35,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21633859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:35,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520324309] [2024-11-12 15:43:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:35,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:43:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:43:35,212 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-12 15:43:35,213 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-12 15:43:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:35,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 15:43:35,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:43:35,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 15:43:35,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:35,539 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-12 15:43:35,546 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-12 15:43:35,572 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-12 15:43:35,577 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-12 15:43:35,652 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-12 15:43:35,656 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-12 15:43:35,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:35,803 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-12 15:43:35,809 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-12 15:43:35,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:35,928 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-12 15:43:35,933 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-12 15:43:36,020 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:36,021 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-12 15:43:36,025 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-12 15:43:36,112 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:36,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-12 15:43:36,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 15:43:36,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:43:36,193 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-12 15:43:36,196 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-12 15:43:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-12 15:43:36,228 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-12 15:43:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:43:36,270 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 15:43:36,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-12 15:43:36,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:43:36,279 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-12 15:43:36,307 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-12 15:43:36,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:43:40,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 15:43:40,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-12 15:43:41,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|) (forall ((v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2511 (Array Int Int)) (v_ArrVal_2510 (Array Int Int)) (v_ArrVal_2509 (Array Int Int)) (v_ArrVal_2517 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2522))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2510))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2511))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2513))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2523) .cse0 v_ArrVal_2509) .cse1 v_ArrVal_2512) .cse2 v_ArrVal_2514) .cse3 v_ArrVal_2516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2517) (select (select (store .cse5 .cse3 v_ArrVal_2515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_26))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_28))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_27))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_24) .cse9 v_prenex_30) .cse10 v_prenex_25) .cse11 v_prenex_22) (select (select (store .cse12 .cse11 v_prenex_23) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_21))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-12 15:43:41,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520324309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:43:41,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:43:41,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-12 15:43:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717892317] [2024-11-12 15:43:41,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:43:41,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 15:43:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 15:43:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1544, Unknown=72, NotChecked=82, Total=1892 [2024-11-12 15:43:41,158 INFO L87 Difference]: Start difference. First operand 632 states and 728 transitions. Second operand has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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-12 15:43:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:45,007 INFO L93 Difference]: Finished difference Result 634 states and 732 transitions. [2024-11-12 15:43:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 15:43:45,007 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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-12 15:43:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:45,009 INFO L225 Difference]: With dead ends: 634 [2024-11-12 15:43:45,009 INFO L226 Difference]: Without dead ends: 634 [2024-11-12 15:43:45,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=356, Invalid=2655, Unknown=73, NotChecked=108, Total=3192 [2024-11-12 15:43:45,010 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 504 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 4328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:45,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 3900 Invalid, 4328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-12 15:43:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-12 15:43:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 612. [2024-11-12 15:43:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 605 states have internal predecessors, (681), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 15:43:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 707 transitions. [2024-11-12 15:43:45,016 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 707 transitions. Word has length 99 [2024-11-12 15:43:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:45,017 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 707 transitions. [2024-11-12 15:43:45,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.551724137931035) internal successors, (161), 30 states have internal predecessors, (161), 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-12 15:43:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 707 transitions. [2024-11-12 15:43:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 15:43:45,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:45,017 INFO L218 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-12 15:43:45,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 15:43:45,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-12 15:43:45,218 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:45,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash -991994657, now seen corresponding path program 1 times [2024-11-12 15:43:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:45,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262245657] [2024-11-12 15:43:45,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:45,916 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-12 15:43:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:45,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262245657] [2024-11-12 15:43:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262245657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 15:43:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779575265] [2024-11-12 15:43:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:45,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 15:43:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 15:43:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-12 15:43:45,918 INFO L87 Difference]: Start difference. First operand 612 states and 707 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 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-12 15:43:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:43:47,553 INFO L93 Difference]: Finished difference Result 638 states and 736 transitions. [2024-11-12 15:43:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:43:47,554 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 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-12 15:43:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:43:47,555 INFO L225 Difference]: With dead ends: 638 [2024-11-12 15:43:47,556 INFO L226 Difference]: Without dead ends: 638 [2024-11-12 15:43:47,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-12 15:43:47,556 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 513 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:43:47,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2991 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:43:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-12 15:43:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2024-11-12 15:43:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 459 states have (on average 1.5337690631808278) internal successors, (704), 626 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 15:43:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 731 transitions. [2024-11-12 15:43:47,562 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 731 transitions. Word has length 101 [2024-11-12 15:43:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:43:47,562 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 731 transitions. [2024-11-12 15:43:47,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 15 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-12 15:43:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 731 transitions. [2024-11-12 15:43:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 15:43:47,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:43:47,562 INFO L218 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-12 15:43:47,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 15:43:47,563 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-12 15:43:47,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:43:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash -991994656, now seen corresponding path program 1 times [2024-11-12 15:43:47,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:43:47,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108651666] [2024-11-12 15:43:47,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:43:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:43:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 15:43:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:43:48,649 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-12 15:43:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:43:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108651666] [2024-11-12 15:43:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108651666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:43:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:43:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 15:43:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963119950] [2024-11-12 15:43:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:43:48,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:43:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:43:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:43:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-12 15:43:48,651 INFO L87 Difference]: Start difference. First operand 634 states and 731 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 18 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)