./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:17:21,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:17:21,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:17:21,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:17:21,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:17:21,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:17:21,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:17:21,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:17:21,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:17:21,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:17:21,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:17:21,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:17:21,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:17:21,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:17:21,798 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:17:21,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:17:21,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:17:21,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:17:21,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:17:21,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:17:21,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:17:21,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:17:21,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:17:21,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:17:21,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:17:21,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:17:21,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:17:21,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:17:21,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:17:21,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:17:21,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:17:21,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:17:21,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:17:21,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:21,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:17:21,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:17:21,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:17:21,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:17:21,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:17:21,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:17:21,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:17:21,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:17:21,807 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-clean/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-clean/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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-10-11 18:17:22,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:17:22,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:17:22,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:17:22,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:17:22,136 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:17:22,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-11 18:17:23,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:17:23,975 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:17:23,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-11 18:17:23,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6811be421/23886bbd4f9b4ee791db1205a990a0c3/FLAGbb99091c0 [2024-10-11 18:17:24,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6811be421/23886bbd4f9b4ee791db1205a990a0c3 [2024-10-11 18:17:24,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:17:24,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:17:24,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:24,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:17:24,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:17:24,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c055a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24, skipping insertion in model container [2024-10-11 18:17:24,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:17:24,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:24,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:17:24,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:17:24,419 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:17:24,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24 WrapperNode [2024-10-11 18:17:24,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:17:24,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:24,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:17:24,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:17:24,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,467 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 182 [2024-10-11 18:17:24,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:17:24,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:17:24,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:17:24,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:17:24,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,509 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-11 18:17:24,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:17:24,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:17:24,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:17:24,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:17:24,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (1/1) ... [2024-10-11 18:17:24,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:17:24,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:24,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:17:24,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:17:24,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:17:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:17:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:17:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:17:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:17:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:17:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:17:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:17:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:17:24,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:17:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:17:24,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:17:24,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:17:25,297 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-11 18:17:25,297 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:17:25,365 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:17:25,366 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 18:17:25,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:25 BoogieIcfgContainer [2024-10-11 18:17:25,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:17:25,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:17:25,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:17:25,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:17:25,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:17:24" (1/3) ... [2024-10-11 18:17:25,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e494c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:25, skipping insertion in model container [2024-10-11 18:17:25,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:24" (2/3) ... [2024-10-11 18:17:25,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e494c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:25, skipping insertion in model container [2024-10-11 18:17:25,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:25" (3/3) ... [2024-10-11 18:17:25,377 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-10-11 18:17:25,396 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:17:25,396 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-10-11 18:17:25,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:17:25,459 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;@fd6d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:17:25,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-10-11 18:17:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 59 states have (on average 2.3728813559322033) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:25,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:25,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:25,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 278979000, now seen corresponding path program 1 times [2024-10-11 18:17:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629501878] [2024-10-11 18:17:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629501878] [2024-10-11 18:17:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629501878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:25,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045355675] [2024-10-11 18:17:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:25,747 INFO L87 Difference]: Start difference. First operand has 126 states, 59 states have (on average 2.3728813559322033) internal successors, (140), 121 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:25,923 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-11 18:17:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:25,931 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:17:25,931 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:17:25,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:25,935 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:25,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:17:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:17:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 116 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2024-10-11 18:17:25,964 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 5 [2024-10-11 18:17:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:25,964 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2024-10-11 18:17:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2024-10-11 18:17:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:17:25,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:25,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:17:25,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:17:25,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash 278979001, now seen corresponding path program 1 times [2024-10-11 18:17:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376586998] [2024-10-11 18:17:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376586998] [2024-10-11 18:17:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376586998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:17:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193871748] [2024-10-11 18:17:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:17:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:17:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:26,058 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:26,180 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-10-11 18:17:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:17:26,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:17:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:26,182 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:17:26,182 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:17:26,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:17:26,183 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:26,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:17:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:17:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.192982456140351) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-10-11 18:17:26,198 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 5 [2024-10-11 18:17:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-10-11 18:17:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:17:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-10-11 18:17:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:17:26,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:26,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:26,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:17:26,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:26,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1927413840, now seen corresponding path program 1 times [2024-10-11 18:17:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949091475] [2024-10-11 18:17:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949091475] [2024-10-11 18:17:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949091475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041974103] [2024-10-11 18:17:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:26,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:26,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:26,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:26,351 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 18:17:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:26,470 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2024-10-11 18:17:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-11 18:17:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:26,472 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:17:26,474 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:17:26,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:26,475 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:26,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:17:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2024-10-11 18:17:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2024-10-11 18:17:26,491 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 10 [2024-10-11 18:17:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2024-10-11 18:17:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 18:17:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2024-10-11 18:17:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:26,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:26,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:17:26,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607865, now seen corresponding path program 1 times [2024-10-11 18:17:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912200027] [2024-10-11 18:17:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912200027] [2024-10-11 18:17:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912200027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368000911] [2024-10-11 18:17:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:26,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:26,658 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:26,870 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-10-11 18:17:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:26,871 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:17:26,871 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:17:26,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:26,872 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:26,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:17:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:17:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2024-10-11 18:17:26,886 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 17 [2024-10-11 18:17:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:26,887 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2024-10-11 18:17:26,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2024-10-11 18:17:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:17:26,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:26,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:26,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:17:26,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:26,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:26,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607864, now seen corresponding path program 1 times [2024-10-11 18:17:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:26,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720470568] [2024-10-11 18:17:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720470568] [2024-10-11 18:17:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720470568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:27,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202377187] [2024-10-11 18:17:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:27,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:27,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:27,133 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:27,323 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2024-10-11 18:17:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 18:17:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:27,324 INFO L225 Difference]: With dead ends: 118 [2024-10-11 18:17:27,324 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:17:27,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:27,325 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:27,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:17:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 18:17:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 113 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-10-11 18:17:27,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 17 [2024-10-11 18:17:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:27,331 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-10-11 18:17:27,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:17:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-10-11 18:17:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:27,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:27,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:27,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:17:27,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:27,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1095353635, now seen corresponding path program 1 times [2024-10-11 18:17:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815657555] [2024-10-11 18:17:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815657555] [2024-10-11 18:17:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815657555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175537537] [2024-10-11 18:17:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:27,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:27,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:17:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:27,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:17:27,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:27,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:17:27,739 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:27,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:17:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:27,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:28,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175537537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:28,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-10-11 18:17:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916258225] [2024-10-11 18:17:28,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:17:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:17:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:17:28,034 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:28,451 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-10-11 18:17:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-10-11 18:17:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:28,452 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:17:28,452 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:17:28,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:17:28,453 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:28,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 841 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:17:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:17:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 18:17:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 112 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2024-10-11 18:17:28,457 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 19 [2024-10-11 18:17:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:28,458 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2024-10-11 18:17:28,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:17:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2024-10-11 18:17:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:17:28,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:28,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:28,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:28,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:28,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:28,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1095353636, now seen corresponding path program 1 times [2024-10-11 18:17:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850088067] [2024-10-11 18:17:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850088067] [2024-10-11 18:17:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850088067] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859314517] [2024-10-11 18:17:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:28,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:28,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:17:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:29,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 18:17:29,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:29,026 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-10-11 18:17:29,031 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-10-11 18:17:29,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:29,179 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-10-11 18:17:29,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:29,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859314517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:29,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-10-11 18:17:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233553603] [2024-10-11 18:17:29,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:29,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:17:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:17:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:17:29,329 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:17:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:29,857 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2024-10-11 18:17:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2024-10-11 18:17:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:29,858 INFO L225 Difference]: With dead ends: 118 [2024-10-11 18:17:29,858 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:17:29,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:17:29,859 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:29,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 864 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:17:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:17:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-11 18:17:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.103448275862069) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-10-11 18:17:29,863 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 19 [2024-10-11 18:17:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-10-11 18:17:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:17:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-10-11 18:17:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:29,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:29,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:29,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:17:30,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:30,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:30,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash 216743692, now seen corresponding path program 1 times [2024-10-11 18:17:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246824176] [2024-10-11 18:17:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:30,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246824176] [2024-10-11 18:17:30,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246824176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706945280] [2024-10-11 18:17:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:30,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:17:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:30,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:17:30,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:30,499 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-10-11 18:17:30,513 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-11 18:17:30,529 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:30,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:17:30,577 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:17:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:17:30,670 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:17:30,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:17:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-10-11 18:17:30,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706945280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:30,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-10-11 18:17:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033160252] [2024-10-11 18:17:30,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:30,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:17:30,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:17:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=303, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:17:30,973 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 18:17:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:31,327 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2024-10-11 18:17:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 27 [2024-10-11 18:17:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:31,328 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:17:31,328 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:17:31,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=402, Unknown=1, NotChecked=42, Total=552 [2024-10-11 18:17:31,329 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 221 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:31,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 426 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 578 Invalid, 0 Unknown, 133 Unchecked, 0.3s Time] [2024-10-11 18:17:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:17:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2024-10-11 18:17:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 102 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2024-10-11 18:17:31,332 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 27 [2024-10-11 18:17:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:31,333 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2024-10-11 18:17:31,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 18:17:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2024-10-11 18:17:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:17:31,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:31,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:31,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:17:31,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:31,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:31,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 216743693, now seen corresponding path program 1 times [2024-10-11 18:17:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695858931] [2024-10-11 18:17:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:17:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695858931] [2024-10-11 18:17:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695858931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391057740] [2024-10-11 18:17:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:32,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:32,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:32,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:17:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:17:32,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:32,120 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-10-11 18:17:32,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:32,141 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-10-11 18:17:32,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:32,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:32,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:32,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:32,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:32,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:32,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:17:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:32,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:32,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391057740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:32,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:32,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-11 18:17:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087813120] [2024-10-11 18:17:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-10-11 18:17:32,252 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:32,364 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-10-11 18:17:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-11 18:17:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:32,365 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:17:32,365 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:17:32,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:32,366 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 29 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:32,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 247 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 136 Unchecked, 0.1s Time] [2024-10-11 18:17:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:17:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-11 18:17:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 97 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-10-11 18:17:32,369 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 27 [2024-10-11 18:17:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:32,369 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-10-11 18:17:32,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-10-11 18:17:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:32,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:32,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:32,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:17:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 18:17:32,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:32,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2132479251, now seen corresponding path program 1 times [2024-10-11 18:17:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:32,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705977265] [2024-10-11 18:17:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705977265] [2024-10-11 18:17:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705977265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677752839] [2024-10-11 18:17:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:32,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:32,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:32,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:32,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:17:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:17:33,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:33,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:33,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:17:33,056 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 18:17:33,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 18:17:33,062 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 17 treesize of output 9 [2024-10-11 18:17:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:33,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677752839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-10-11 18:17:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24612351] [2024-10-11 18:17:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:17:33,066 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:33,187 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2024-10-11 18:17:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-11 18:17:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:33,189 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:17:33,189 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:17:33,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:17:33,190 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:33,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 299 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 172 Unchecked, 0.1s Time] [2024-10-11 18:17:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:17:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2024-10-11 18:17:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-10-11 18:17:33,192 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 29 [2024-10-11 18:17:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:33,193 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-10-11 18:17:33,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-10-11 18:17:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:17:33,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:33,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:33,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:17:33,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2132479252, now seen corresponding path program 1 times [2024-10-11 18:17:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597808728] [2024-10-11 18:17:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597808728] [2024-10-11 18:17:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597808728] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589938668] [2024-10-11 18:17:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:33,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:33,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:33,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:33,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:17:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:34,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:17:34,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:34,121 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-10-11 18:17:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:34,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:34,303 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-11 18:17:34,327 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:34,328 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 15 treesize of output 15 [2024-10-11 18:17:34,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:34,372 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 17 treesize of output 9 [2024-10-11 18:17:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-11 18:17:34,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:34,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589938668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:34,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:34,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-10-11 18:17:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202597093] [2024-10-11 18:17:34,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 18:17:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:34,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 18:17:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=631, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:17:34,560 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:35,481 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-10-11 18:17:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:17:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-10-11 18:17:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:35,483 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:17:35,483 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:17:35,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=1332, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 18:17:35,484 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 251 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:35,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 882 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1104 Invalid, 0 Unknown, 144 Unchecked, 0.6s Time] [2024-10-11 18:17:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:17:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2024-10-11 18:17:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.796875) internal successors, (115), 103 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2024-10-11 18:17:35,487 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 29 [2024-10-11 18:17:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:35,487 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2024-10-11 18:17:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.263157894736842) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:17:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2024-10-11 18:17:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:17:35,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:35,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:35,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:17:35,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:17:35,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:35,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1682345722, now seen corresponding path program 1 times [2024-10-11 18:17:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478940432] [2024-10-11 18:17:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478940432] [2024-10-11 18:17:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478940432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:35,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:35,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127784144] [2024-10-11 18:17:35,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:35,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:35,762 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:35,839 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2024-10-11 18:17:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 18:17:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:35,841 INFO L225 Difference]: With dead ends: 110 [2024-10-11 18:17:35,841 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 18:17:35,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:17:35,842 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:35,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 18:17:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 18:17:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.7846153846153847) internal successors, (116), 104 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-10-11 18:17:35,846 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 30 [2024-10-11 18:17:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-10-11 18:17:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-10-11 18:17:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:17:35,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:35,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:35,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:17:35,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:35,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 613371856, now seen corresponding path program 1 times [2024-10-11 18:17:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521647397] [2024-10-11 18:17:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:17:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521647397] [2024-10-11 18:17:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521647397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772019636] [2024-10-11 18:17:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:36,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:36,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:17:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:17:36,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:36,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772019636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:36,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-11 18:17:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475523643] [2024-10-11 18:17:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:36,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:36,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:36,170 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:36,215 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-10-11 18:17:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:36,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-11 18:17:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:36,216 INFO L225 Difference]: With dead ends: 111 [2024-10-11 18:17:36,216 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 18:17:36,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:17:36,217 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 67 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:36,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:17:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 18:17:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2024-10-11 18:17:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.75) internal successors, (112), 101 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-10-11 18:17:36,219 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 31 [2024-10-11 18:17:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:36,219 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-10-11 18:17:36,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-10-11 18:17:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:36,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:36,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:36,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:17:36,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1826783259, now seen corresponding path program 1 times [2024-10-11 18:17:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060988453] [2024-10-11 18:17:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 18:17:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060988453] [2024-10-11 18:17:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060988453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:36,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551186220] [2024-10-11 18:17:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:36,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:36,524 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:36,665 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2024-10-11 18:17:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:36,666 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:17:36,667 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:17:36,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:36,667 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 15 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:36,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 325 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:17:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:17:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.703125) internal successors, (109), 98 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2024-10-11 18:17:36,670 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2024-10-11 18:17:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:36,670 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2024-10-11 18:17:36,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:36,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2024-10-11 18:17:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:36,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:36,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:17:36,671 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:36,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1826783260, now seen corresponding path program 1 times [2024-10-11 18:17:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682211678] [2024-10-11 18:17:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682211678] [2024-10-11 18:17:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682211678] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314444447] [2024-10-11 18:17:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:36,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:36,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:36,843 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:36,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:17:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:17:37,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:37,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314444447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 18:17:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773392087] [2024-10-11 18:17:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:17:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:17:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:17:37,089 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:37,160 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-10-11 18:17:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:17:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-10-11 18:17:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:37,161 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:17:37,161 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:17:37,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:17:37,164 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:37,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:17:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-10-11 18:17:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 97 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-10-11 18:17:37,167 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2024-10-11 18:17:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-10-11 18:17:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-10-11 18:17:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:37,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:37,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:37,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:17:37,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:17:37,373 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:37,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:37,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1834656733, now seen corresponding path program 1 times [2024-10-11 18:17:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36824604] [2024-10-11 18:17:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36824604] [2024-10-11 18:17:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36824604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:37,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679224376] [2024-10-11 18:17:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:37,618 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:37,782 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-10-11 18:17:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:37,787 INFO L225 Difference]: With dead ends: 102 [2024-10-11 18:17:37,787 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 18:17:37,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:37,788 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:37,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 18:17:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-11 18:17:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 96 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-10-11 18:17:37,802 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2024-10-11 18:17:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:37,803 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-10-11 18:17:37,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-10-11 18:17:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:17:37,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:37,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:37,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:17:37,804 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:37,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1834656734, now seen corresponding path program 1 times [2024-10-11 18:17:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:37,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239352286] [2024-10-11 18:17:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239352286] [2024-10-11 18:17:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239352286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:37,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:17:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186474481] [2024-10-11 18:17:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:17:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:17:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:37,934 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:38,037 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2024-10-11 18:17:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:17:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-11 18:17:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:38,038 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:17:38,038 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:17:38,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:17:38,039 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:38,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:17:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:17:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 95 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-10-11 18:17:38,041 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2024-10-11 18:17:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:38,042 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-10-11 18:17:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-10-11 18:17:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:17:38,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:38,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:38,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:17:38,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1039783903, now seen corresponding path program 1 times [2024-10-11 18:17:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:38,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026240251] [2024-10-11 18:17:38,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:17:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026240251] [2024-10-11 18:17:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026240251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:38,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:38,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:38,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187678746] [2024-10-11 18:17:38,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:38,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:38,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:38,215 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:38,351 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-11 18:17:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-11 18:17:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:38,352 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:17:38,352 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:17:38,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:38,352 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 11 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:38,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 329 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:17:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:17:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.619047619047619) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-10-11 18:17:38,355 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 33 [2024-10-11 18:17:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-10-11 18:17:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-10-11 18:17:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:17:38,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:38,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:17:38,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:17:38,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1495048160, now seen corresponding path program 1 times [2024-10-11 18:17:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448723894] [2024-10-11 18:17:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:17:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448723894] [2024-10-11 18:17:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448723894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:17:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:17:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483788712] [2024-10-11 18:17:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:17:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:38,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:17:38,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:17:38,533 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:38,632 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-10-11 18:17:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-11 18:17:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:38,633 INFO L225 Difference]: With dead ends: 95 [2024-10-11 18:17:38,633 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 18:17:38,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:17:38,634 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 85 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:38,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 207 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 18:17:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 18:17:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 88 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-11 18:17:38,637 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 35 [2024-10-11 18:17:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-11 18:17:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-11 18:17:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:17:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:38,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-10-11 18:17:38,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 18:17:38,638 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:38,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 898152295, now seen corresponding path program 1 times [2024-10-11 18:17:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646521827] [2024-10-11 18:17:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646521827] [2024-10-11 18:17:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646521827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294625713] [2024-10-11 18:17:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:38,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:38,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:38,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:17:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:38,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:17:38,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:38,934 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-10-11 18:17:38,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:39,024 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:17:39,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:17:39,082 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 17 treesize of output 9 [2024-10-11 18:17:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:39,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:39,256 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 18 treesize of output 10 [2024-10-11 18:17:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294625713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:39,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 21 [2024-10-11 18:17:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634850773] [2024-10-11 18:17:39,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:17:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:17:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:17:39,282 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:17:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:39,770 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-10-11 18:17:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:17:39,771 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2024-10-11 18:17:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:39,772 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:17:39,772 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:17:39,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:17:39,773 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 94 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:39,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 784 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:17:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:17:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2024-10-11 18:17:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-10-11 18:17:39,775 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 36 [2024-10-11 18:17:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-10-11 18:17:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 18:17:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-10-11 18:17:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:17:39,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:39,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-10-11 18:17:39,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:17:39,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:39,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:39,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash 898152296, now seen corresponding path program 1 times [2024-10-11 18:17:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455244706] [2024-10-11 18:17:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455244706] [2024-10-11 18:17:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455244706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242378615] [2024-10-11 18:17:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:40,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:40,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:40,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:17:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:40,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:17:40,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:40,737 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-10-11 18:17:40,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:40,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:17:40,972 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:17:40,973 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 15 treesize of output 15 [2024-10-11 18:17:40,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:17:41,049 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 17 treesize of output 9 [2024-10-11 18:17:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:17:41,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242378615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:41,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-10-11 18:17:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495130882] [2024-10-11 18:17:41,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:17:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:17:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:17:41,200 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:41,941 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-10-11 18:17:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:17:41,942 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-10-11 18:17:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:41,943 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:17:41,943 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:17:41,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=1402, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 18:17:41,944 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:41,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 744 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:17:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:17:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2024-10-11 18:17:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-11 18:17:41,947 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 36 [2024-10-11 18:17:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:41,947 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-11 18:17:41,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.5) internal successors, (50), 22 states have internal predecessors, (50), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:17:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-11 18:17:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:17:41,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:41,947 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-10-11 18:17:41,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:17:42,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 820566855, now seen corresponding path program 1 times [2024-10-11 18:17:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924467662] [2024-10-11 18:17:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924467662] [2024-10-11 18:17:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924467662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952466596] [2024-10-11 18:17:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:42,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:42,289 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:42,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:17:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:42,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:17:42,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:42,529 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 7 treesize of output 3 [2024-10-11 18:17:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:42,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 18:17:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952466596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:17:42,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:17:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 18:17:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241218539] [2024-10-11 18:17:42,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:42,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:17:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:42,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:17:42,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:17:42,642 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:42,797 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-10-11 18:17:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:17:42,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-11 18:17:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:42,798 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:17:42,799 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:17:42,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:17:42,799 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:42,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 554 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:17:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:17:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.46875) internal successors, (94), 84 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-11 18:17:42,802 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 37 [2024-10-11 18:17:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-11 18:17:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:17:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-11 18:17:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:42,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:42,803 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-10-11 18:17:42,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:17:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:17:43,008 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 135658185, now seen corresponding path program 1 times [2024-10-11 18:17:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030043802] [2024-10-11 18:17:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030043802] [2024-10-11 18:17:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030043802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655162274] [2024-10-11 18:17:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:43,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:43,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:43,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:17:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:17:43,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:43,443 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 15 treesize of output 1 [2024-10-11 18:17:43,457 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 17 treesize of output 9 [2024-10-11 18:17:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 18:17:43,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655162274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:43,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 18:17:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468274257] [2024-10-11 18:17:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:43,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:17:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:17:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:17:43,470 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:43,594 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2024-10-11 18:17:43,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:17:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 18:17:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:43,595 INFO L225 Difference]: With dead ends: 127 [2024-10-11 18:17:43,595 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 18:17:43,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:17:43,596 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 50 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:43,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 316 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:17:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 18:17:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-10-11 18:17:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.476923076923077) internal successors, (96), 85 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2024-10-11 18:17:43,599 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 38 [2024-10-11 18:17:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:43,599 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2024-10-11 18:17:43,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2024-10-11 18:17:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:17:43,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:43,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-10-11 18:17:43,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:17:43,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:43,804 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:43,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 135658186, now seen corresponding path program 1 times [2024-10-11 18:17:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887106632] [2024-10-11 18:17:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:17:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887106632] [2024-10-11 18:17:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887106632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634150146] [2024-10-11 18:17:44,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:44,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:44,045 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:44,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:17:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:44,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:17:44,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:44,257 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-10-11 18:17:44,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 15 treesize of output 1 [2024-10-11 18:17:44,386 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 11 treesize of output 7 [2024-10-11 18:17:44,409 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 17 treesize of output 9 [2024-10-11 18:17:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:17:44,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:17:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634150146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:17:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:17:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-11 18:17:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646133594] [2024-10-11 18:17:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:17:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:17:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:44,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:17:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:17:44,428 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:44,627 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2024-10-11 18:17:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:17:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 18:17:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:44,628 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:17:44,628 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:17:44,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:17:44,629 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 538 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:17:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:17:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2024-10-11 18:17:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 82 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-10-11 18:17:44,631 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 38 [2024-10-11 18:17:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-11 18:17:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:17:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-10-11 18:17:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 18:17:44,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:44,632 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-10-11 18:17:44,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:17:44,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:44,837 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1243973202, now seen corresponding path program 1 times [2024-10-11 18:17:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:44,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668980429] [2024-10-11 18:17:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:17:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668980429] [2024-10-11 18:17:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668980429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754947466] [2024-10-11 18:17:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:46,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:46,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:17:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:46,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-11 18:17:46,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:46,528 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-10-11 18:17:46,705 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-10-11 18:17:46,752 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:17:46,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:17:46,842 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 25 treesize of output 13 [2024-10-11 18:17:46,908 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 26 treesize of output 21 [2024-10-11 18:17:46,979 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 17 treesize of output 3 [2024-10-11 18:17:46,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:47,089 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 18:17:47,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 18:17:51,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse0) .cse1) 1)))))))) is different from false [2024-10-11 18:17:51,117 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4))) (or (= (select (select |c_#memory_int#1| .cse0) .cse1) 1) (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse2 (select |c_#memory_int#1| .cse2))) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse0) .cse1) 1)))))))) is different from true [2024-10-11 18:17:51,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:51,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-11 18:17:51,396 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 26 treesize of output 21 [2024-10-11 18:17:51,446 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 25 treesize of output 17 [2024-10-11 18:17:51,450 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 21 treesize of output 13 [2024-10-11 18:17:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:17:51,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:53,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3000 Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| v_ArrVal_3000))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3001) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-10-11 18:17:53,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| Int) (v_ArrVal_3001 (Array Int Int)) (v_ArrVal_3000 Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_28| v_ArrVal_3000))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3001) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-10-11 18:17:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754947466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:54,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2024-10-11 18:17:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723386864] [2024-10-11 18:17:54,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:54,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 18:17:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:54,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 18:17:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2548, Unknown=41, NotChecked=312, Total=3080 [2024-10-11 18:17:54,092 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 48 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:54,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse5 (select .cse2 0)) (.cse8 (+ (select .cse3 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse5) .cse8) 1)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= .cse1 .cse2) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse4) 1) (= .cse4 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 .cse6) (not (= .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (not (= .cse5 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse7 (select |c_#memory_int#1| .cse7))) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5) .cse8) 1))))) (= (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 4)))))) is different from false [2024-10-11 18:17:54,654 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse5 (select .cse2 0)) (.cse8 (+ (select .cse3 0) 4))) (let ((.cse0 (= (select (select |c_#memory_int#1| .cse5) .cse8) 1)) (.cse6 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse4 (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (and .cse0 (= .cse1 .cse2) (= (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |c_#valid| .cse4) 1) (= .cse4 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse3 .cse6) (not (= .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (not (= .cse5 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or .cse0 (exists ((|v_old(#memory_int#1)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_old(#memory_int#1)_AFTER_CALL_40| |c_#memory_int#1|))) (and (= .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (= |c_#memory_int#1| (store |v_old(#memory_int#1)_AFTER_CALL_40| .cse7 (select |c_#memory_int#1| .cse7))) (= (select (select |v_old(#memory_int#1)_AFTER_CALL_40| .cse5) .cse8) 1))))) (= (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 4)))))) is different from true [2024-10-11 18:17:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:17:55,666 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-10-11 18:17:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 18:17:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-10-11 18:17:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:17:55,667 INFO L225 Difference]: With dead ends: 124 [2024-10-11 18:17:55,667 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:17:55,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=391, Invalid=4694, Unknown=43, NotChecked=572, Total=5700 [2024-10-11 18:17:55,669 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 118 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:17:55,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1356 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1438 Invalid, 0 Unknown, 175 Unchecked, 0.7s Time] [2024-10-11 18:17:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:17:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2024-10-11 18:17:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:17:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-10-11 18:17:55,671 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 40 [2024-10-11 18:17:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:17:55,671 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-10-11 18:17:55,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:17:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-10-11 18:17:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:17:55,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:17:55,672 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-10-11 18:17:55,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:17:55,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:17:55,873 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:17:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:17:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -88392102, now seen corresponding path program 1 times [2024-10-11 18:17:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:17:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424637255] [2024-10-11 18:17:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:17:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:17:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:17:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:17:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:17:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:17:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424637255] [2024-10-11 18:17:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424637255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554798308] [2024-10-11 18:17:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:17:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:17:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:17:56,447 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:17:56,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:17:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:17:56,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 18:17:56,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:17:56,669 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-10-11 18:17:56,755 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:17:56,756 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-10-11 18:17:56,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:17:56,843 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:17:56,843 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 70 treesize of output 57 [2024-10-11 18:17:56,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-10-11 18:17:56,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:17:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:17:57,006 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 46 treesize of output 35 [2024-10-11 18:17:57,029 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2024-10-11 18:17:57,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 65 [2024-10-11 18:17:57,191 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-11 18:17:57,192 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 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-11 18:17:57,307 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:17:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 104 treesize of output 88 [2024-10-11 18:17:57,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:17:57,476 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 152 treesize of output 104 [2024-10-11 18:17:57,480 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 103 treesize of output 75 [2024-10-11 18:17:57,595 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 79 treesize of output 51 [2024-10-11 18:17:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:17:57,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:17:57,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3191 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3191) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-10-11 18:17:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554798308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:17:57,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:17:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 37 [2024-10-11 18:17:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050988980] [2024-10-11 18:17:57,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:17:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 18:17:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:17:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 18:17:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1480, Unknown=37, NotChecked=78, Total=1722 [2024-10-11 18:17:57,974 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:07,778 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2024-10-11 18:18:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 18:18:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-10-11 18:18:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:07,779 INFO L225 Difference]: With dead ends: 195 [2024-10-11 18:18:07,779 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 18:18:07,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=371, Invalid=3882, Unknown=41, NotChecked=128, Total=4422 [2024-10-11 18:18:07,780 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 264 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:07,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1131 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 18:18:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 18:18:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 97. [2024-10-11 18:18:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 91 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:18:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-10-11 18:18:07,783 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 41 [2024-10-11 18:18:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:07,783 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-10-11 18:18:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-10-11 18:18:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:18:07,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:07,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-10-11 18:18:07,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:18:07,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:18:07,985 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:18:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -88392101, now seen corresponding path program 1 times [2024-10-11 18:18:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654125636] [2024-10-11 18:18:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:18:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654125636] [2024-10-11 18:18:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654125636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743752630] [2024-10-11 18:18:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:08,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:08,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:08,998 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:18:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:09,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-11 18:18:09,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:09,230 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-10-11 18:18:09,235 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-10-11 18:18:09,498 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:18:09,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:18:09,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:18:09,601 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 11 treesize of output 7 [2024-10-11 18:18:09,612 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 11 treesize of output 7 [2024-10-11 18:18:09,678 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-11 18:18:09,678 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 119 treesize of output 88 [2024-10-11 18:18:09,684 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 48 treesize of output 19 [2024-10-11 18:18:09,745 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 55 treesize of output 19 [2024-10-11 18:18:09,750 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 15 treesize of output 3 [2024-10-11 18:18:09,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 18:18:09,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:18:10,107 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:18:10,107 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2024-10-11 18:18:10,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:18:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:18:10,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2024-10-11 18:18:10,136 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2024-10-11 18:18:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 37 [2024-10-11 18:18:10,154 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-11 18:18:10,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-11 18:18:10,418 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-11 18:18:10,419 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 1 case distinctions, treesize of input 65 treesize of output 56 [2024-10-11 18:18:10,433 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-11 18:18:10,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-10-11 18:18:10,611 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:18:10,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 117 treesize of output 101 [2024-10-11 18:18:10,628 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:18:10,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 130 treesize of output 132 [2024-10-11 18:18:10,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:18:10,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:18:10,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:18:11,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 208 [2024-10-11 18:18:11,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:11,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 226 treesize of output 190 [2024-10-11 18:18:11,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 169 treesize of output 145 [2024-10-11 18:18:11,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:18:11,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 117 treesize of output 141 [2024-10-11 18:18:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:12,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:12,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3392) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3391) .cse0) .cse1)))) (forall ((v_ArrVal_3392 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3392) .cse0) .cse1) 4))))) is different from false [2024-10-11 18:18:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743752630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:14,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:18:14,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2024-10-11 18:18:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685486849] [2024-10-11 18:18:14,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 18:18:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:14,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 18:18:14,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2188, Unknown=44, NotChecked=94, Total=2450 [2024-10-11 18:18:14,064 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 43 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:18,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:26,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:30,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:18:30,436 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2024-10-11 18:18:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 18:18:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-10-11 18:18:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:18:30,438 INFO L225 Difference]: With dead ends: 197 [2024-10-11 18:18:30,438 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 18:18:30,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=459, Invalid=6307, Unknown=44, NotChecked=162, Total=6972 [2024-10-11 18:18:30,440 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 261 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:18:30,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1481 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2263 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2024-10-11 18:18:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 18:18:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-10-11 18:18:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 92 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:18:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2024-10-11 18:18:30,443 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 41 [2024-10-11 18:18:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:18:30,443 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2024-10-11 18:18:30,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:18:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2024-10-11 18:18:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 18:18:30,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:18:30,444 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-10-11 18:18:30,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:18:30,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:18:30,645 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-11 18:18:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:18:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1010939724, now seen corresponding path program 1 times [2024-10-11 18:18:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:18:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119579572] [2024-10-11 18:18:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:18:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:18:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 18:18:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 18:18:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:18:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119579572] [2024-10-11 18:18:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119579572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:18:30,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884697676] [2024-10-11 18:18:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:18:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:18:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:18:30,834 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:18:30,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:18:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:18:31,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:18:31,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:18:31,109 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 16 treesize of output 8 [2024-10-11 18:18:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:18:31,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:18:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:18:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884697676] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:18:31,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:18:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2024-10-11 18:18:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487203012] [2024-10-11 18:18:31,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:18:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:18:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:18:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:18:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:18:31,161 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:18:35,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:39,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:43,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:47,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:18:51,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]