./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:39:49,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:39:49,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:39:49,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:39:49,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:39:49,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:39:49,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:39:49,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:39:49,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:39:49,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:39:49,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:39:49,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:39:49,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:39:49,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:39:49,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:39:49,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:39:49,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:39:49,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:39:49,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:39:49,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:39:49,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:39:49,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:39:49,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:39:49,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:39:49,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:39:49,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:39:49,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:39:49,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:49,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:39:49,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:39:49,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:39:49,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:39:49,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:39:49,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:39:49,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:39:49,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:39:49,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:39:49,259 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 ! call(reach_error())) ) 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 -> 503a3e49b44041609ec1bba765b53912c88abb90ff278e61e68e863904faf4bb [2024-10-11 01:39:49,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:39:49,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:39:49,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:39:49,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:39:49,678 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:39:49,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2024-10-11 01:39:51,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:39:51,636 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:39:51,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2024-10-11 01:39:51,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d8c9a4181/6b5bc119880645c1bba27b5822fa080f/FLAG15d0f7b86 [2024-10-11 01:39:51,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d8c9a4181/6b5bc119880645c1bba27b5822fa080f [2024-10-11 01:39:51,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:39:51,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:39:51,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:51,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:39:51,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:39:51,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:51" (1/1) ... [2024-10-11 01:39:51,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dd7133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:51, skipping insertion in model container [2024-10-11 01:39:51,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:51" (1/1) ... [2024-10-11 01:39:51,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:39:52,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2024-10-11 01:39:52,235 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2024-10-11 01:39:52,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2024-10-11 01:39:52,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2024-10-11 01:39:52,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:52,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:39:52,293 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2024-10-11 01:39:52,293 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2024-10-11 01:39:52,294 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2024-10-11 01:39:52,295 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2024-10-11 01:39:52,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:52,326 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:39:52,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52 WrapperNode [2024-10-11 01:39:52,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:52,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:52,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:39:52,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:39:52,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,361 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2024-10-11 01:39:52,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:52,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:39:52,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:39:52,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:39:52,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,391 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-10-11 01:39:52,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:39:52,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:39:52,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:39:52,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:39:52,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (1/1) ... [2024-10-11 01:39:52,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:52,440 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 01:39:52,443 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 01:39:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:39:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:39:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:39:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:39:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:39:52,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:39:52,633 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:39:52,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:39:52,955 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 01:39:52,955 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:39:53,006 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:39:53,007 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 01:39:53,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:53 BoogieIcfgContainer [2024-10-11 01:39:53,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:39:53,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:39:53,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:39:53,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:39:53,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:39:51" (1/3) ... [2024-10-11 01:39:53,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15edbcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:53, skipping insertion in model container [2024-10-11 01:39:53,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:52" (2/3) ... [2024-10-11 01:39:53,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15edbcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:53, skipping insertion in model container [2024-10-11 01:39:53,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:53" (3/3) ... [2024-10-11 01:39:53,024 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2024-10-11 01:39:53,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:39:53,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 01:39:53,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:39:53,184 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=LoopHeads, 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;@4a281a9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:39:53,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 01:39:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 01:39:53,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:53,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 01:39:53,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 154845866, now seen corresponding path program 1 times [2024-10-11 01:39:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206909468] [2024-10-11 01:39:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:53,480 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 01:39:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206909468] [2024-10-11 01:39:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206909468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:39:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274244669] [2024-10-11 01:39:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:53,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:39:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:39:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:39:53,554 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:53,595 INFO L93 Difference]: Finished difference Result 56 states and 93 transitions. [2024-10-11 01:39:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:39:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 01:39:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:53,615 INFO L225 Difference]: With dead ends: 56 [2024-10-11 01:39:53,616 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:39:53,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:39:53,627 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:53,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:39:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:39:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-11 01:39:53,712 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2024-10-11 01:39:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:53,712 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-11 01:39:53,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-11 01:39:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:39:53,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:53,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:39:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:39:53,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:53,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash 492885517, now seen corresponding path program 1 times [2024-10-11 01:39:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:53,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570331750] [2024-10-11 01:39:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:54,066 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 01:39:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570331750] [2024-10-11 01:39:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570331750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417069277] [2024-10-11 01:39:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:54,074 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:54,168 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 01:39:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:39:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:39:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:54,171 INFO L225 Difference]: With dead ends: 32 [2024-10-11 01:39:54,171 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 01:39:54,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:54,172 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:54,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 01:39:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2024-10-11 01:39:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-11 01:39:54,180 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2024-10-11 01:39:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:54,181 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-11 01:39:54,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-11 01:39:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:54,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:54,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:39:54,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash -936802660, now seen corresponding path program 1 times [2024-10-11 01:39:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:54,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889422849] [2024-10-11 01:39:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:54,492 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 01:39:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:54,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889422849] [2024-10-11 01:39:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889422849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606903061] [2024-10-11 01:39:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:54,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:54,501 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:54,644 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-10-11 01:39:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:39:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 01:39:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:54,645 INFO L225 Difference]: With dead ends: 56 [2024-10-11 01:39:54,645 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 01:39:54,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:39:54,646 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:54,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 55 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 01:39:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2024-10-11 01:39:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-11 01:39:54,658 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 9 [2024-10-11 01:39:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-11 01:39:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-11 01:39:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:39:54,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:54,659 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:39:54,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1923452346, now seen corresponding path program 1 times [2024-10-11 01:39:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260861528] [2024-10-11 01:39:54,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260861528] [2024-10-11 01:39:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260861528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450628188] [2024-10-11 01:39:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:55,185 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 01:39:55,188 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 01:39:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:55,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 01:39:55,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:55,342 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 01:39:55,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-10-11 01:39:55,363 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 01:39:55,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,411 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 01:39:55,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:39:55,431 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 16 treesize of output 15 [2024-10-11 01:39:55,463 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:39:55,464 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 01:39:55,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-11 01:39:55,525 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:39:55,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-10-11 01:39:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:55,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450628188] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:55,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-11 01:39:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852267066] [2024-10-11 01:39:55,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:55,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 01:39:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 01:39:55,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 01:39:55,713 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:55,916 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-11 01:39:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:39:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 01:39:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:55,918 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:39:55,918 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:39:55,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:39:55,919 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:55,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 75 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:39:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2024-10-11 01:39:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-11 01:39:55,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2024-10-11 01:39:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:55,927 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-11 01:39:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-11 01:39:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:39:55,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:55,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:55,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:39:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:56,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:56,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash -69079933, now seen corresponding path program 1 times [2024-10-11 01:39:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:56,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295947656] [2024-10-11 01:39:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:56,188 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 01:39:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295947656] [2024-10-11 01:39:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295947656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282401755] [2024-10-11 01:39:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:39:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:39:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:56,190 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:56,243 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 01:39:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:39:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 01:39:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:56,244 INFO L225 Difference]: With dead ends: 37 [2024-10-11 01:39:56,244 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 01:39:56,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:56,245 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:56,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 01:39:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-11 01:39:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-11 01:39:56,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2024-10-11 01:39:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-11 01:39:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-11 01:39:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 01:39:56,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:56,255 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:56,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:39:56,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:56,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 448129033, now seen corresponding path program 1 times [2024-10-11 01:39:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770361220] [2024-10-11 01:39:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770361220] [2024-10-11 01:39:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770361220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664967977] [2024-10-11 01:39:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:56,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:56,434 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 01:39:56,439 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 01:39:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:56,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:39:56,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:56,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2024-10-11 01:39:56,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2024-10-11 01:39:56,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-10-11 01:39:56,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2024-10-11 01:39:56,678 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-10-11 01:39:56,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 78 [2024-10-11 01:39:56,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-10-11 01:39:56,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:39:56,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:39:56,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:56,813 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 0 case distinctions, treesize of input 38 treesize of output 19 [2024-10-11 01:39:57,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:57,262 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 120 treesize of output 110 [2024-10-11 01:39:57,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2024-10-11 01:39:57,272 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 37 treesize of output 35 [2024-10-11 01:39:57,280 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 01:39:57,293 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 17 treesize of output 9 [2024-10-11 01:39:57,301 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 13 treesize of output 9 [2024-10-11 01:39:57,313 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 11 treesize of output 7 [2024-10-11 01:39:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:57,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664967977] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:57,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-11 01:39:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600260387] [2024-10-11 01:39:57,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:39:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:39:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:39:57,360 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:57,749 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-11 01:39:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 01:39:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:57,750 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:39:57,750 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:39:57,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:39:57,752 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:57,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:39:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:39:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:39:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-11 01:39:57,757 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2024-10-11 01:39:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:57,757 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-11 01:39:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-11 01:39:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:39:57,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:57,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:57,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:39:57,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:57,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:39:57,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1096237867, now seen corresponding path program 1 times [2024-10-11 01:39:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:57,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149038456] [2024-10-11 01:39:57,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149038456] [2024-10-11 01:39:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149038456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937674229] [2024-10-11 01:39:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:58,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:58,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:58,616 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 01:39:58,620 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 01:39:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:58,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 01:39:58,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:58,731 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 01:39:58,732 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 1 case distinctions, treesize of input 9 treesize of output 11 [2024-10-11 01:39:58,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-11 01:39:58,783 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:39:58,783 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 16 treesize of output 15 [2024-10-11 01:39:58,788 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 01:39:58,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-11 01:39:58,803 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:39:58,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 01:39:58,830 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-11 01:39:58,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2024-10-11 01:39:58,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:58,890 INFO L349 Elim1Store]: treesize reduction 33, result has 29.8 percent of original size [2024-10-11 01:39:58,891 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2024-10-11 01:39:58,904 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-10-11 01:39:58,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2024-10-11 01:39:58,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-10-11 01:39:58,927 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2024-10-11 01:39:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 01:39:59,094 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 01:39:59,147 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:39:59,148 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-10-11 01:39:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:59,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:59,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,203 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-10-11 01:39:59,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_426))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_428) .cse1 v_ArrVal_427) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) |c_ULTIMATE.start_main_~null~0#1.base|)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2024-10-11 01:39:59,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2024-10-11 01:39:59,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2024-10-11 01:39:59,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 3444 treesize of output 2309 [2024-10-11 01:39:59,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 934 treesize of output 830 [2024-10-11 01:39:59,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,510 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 701 treesize of output 635 [2024-10-11 01:39:59,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:59,542 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 540 treesize of output 511 [2024-10-11 01:39:59,590 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 496 treesize of output 460 [2024-10-11 01:39:59,616 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 460 treesize of output 442 [2024-10-11 01:40:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937674229] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:40:28,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:40:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2024-10-11 01:40:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429414790] [2024-10-11 01:40:28,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:40:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:40:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:40:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2024-10-11 01:40:28,258 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:28,969 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2024-10-11 01:40:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:40:28,970 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 01:40:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:28,971 INFO L225 Difference]: With dead ends: 87 [2024-10-11 01:40:28,971 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 01:40:28,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2024-10-11 01:40:28,972 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 211 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:28,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 221 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 244 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2024-10-11 01:40:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 01:40:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2024-10-11 01:40:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-11 01:40:28,990 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2024-10-11 01:40:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-11 01:40:28,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-11 01:40:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:40:28,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:28,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:40:29,006 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 01:40:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:29,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:40:29,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2117306221, now seen corresponding path program 1 times [2024-10-11 01:40:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:29,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953546138] [2024-10-11 01:40:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953546138] [2024-10-11 01:40:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953546138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122487653] [2024-10-11 01:40:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:29,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:29,681 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 01:40:29,683 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 01:40:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:29,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 01:40:29,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:29,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-10-11 01:40:29,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:29,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-10-11 01:40:29,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-11 01:40:29,856 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:40:29,856 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 16 treesize of output 15 [2024-10-11 01:40:29,862 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 01:40:29,866 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-10-11 01:40:29,878 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:40:29,879 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 16 treesize of output 15 [2024-10-11 01:40:29,891 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:40:29,892 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 01:40:29,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:40:29,908 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 60 treesize of output 53 [2024-10-11 01:40:29,912 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 24 treesize of output 11 [2024-10-11 01:40:29,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 01:40:30,029 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 27 treesize of output 15 [2024-10-11 01:40:30,032 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 7 treesize of output 3 [2024-10-11 01:40:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:30,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:40:30,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-10-11 01:40:30,145 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_529 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_ArrVal_530 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-10-11 01:40:30,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:30,155 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-10-11 01:40:30,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:30,162 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2024-10-11 01:40:30,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:30,170 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 64 treesize of output 47 [2024-10-11 01:40:30,173 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 29 treesize of output 27 [2024-10-11 01:40:30,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:30,182 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 48 treesize of output 51 [2024-10-11 01:40:30,186 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 35 treesize of output 33 [2024-10-11 01:40:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122487653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:40:30,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:40:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2024-10-11 01:40:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850999718] [2024-10-11 01:40:30,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:40:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:40:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:40:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-11 01:40:30,248 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:30,601 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2024-10-11 01:40:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:40:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 01:40:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:30,603 INFO L225 Difference]: With dead ends: 82 [2024-10-11 01:40:30,603 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 01:40:30,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=557, Unknown=1, NotChecked=50, Total=756 [2024-10-11 01:40:30,604 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 68 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:30,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 320 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-10-11 01:40:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 01:40:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-11 01:40:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-10-11 01:40:30,611 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 19 [2024-10-11 01:40:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-10-11 01:40:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-10-11 01:40:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 01:40:30,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:30,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:40:30,624 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 01:40:30,816 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,SelfDestructingSolverStorable7 [2024-10-11 01:40:30,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 01:40:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash -905030899, now seen corresponding path program 1 times [2024-10-11 01:40:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:30,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300814088] [2024-10-11 01:40:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:40:30,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:40:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:40:30,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:40:30,862 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:40:30,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-11 01:40:30,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-11 01:40:30,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-10-11 01:40:30,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-11 01:40:30,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 01:40:30,866 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:40:30,883 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:40:30,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:40:30 BoogieIcfgContainer [2024-10-11 01:40:30,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:40:30,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:40:30,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:40:30,886 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:40:30,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:53" (3/4) ... [2024-10-11 01:40:30,890 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:40:30,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:40:30,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:40:30,928 INFO L158 Benchmark]: Toolchain (without parser) took 39014.14ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 137.3MB in the beginning and 1.1GB in the end (delta: -937.7MB). Peak memory consumption was 393.0MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.10ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 117.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.37ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 172.0MB. Free memory was 115.3MB in the beginning and 112.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: RCFGBuilder took 600.70ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 93.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,928 INFO L158 Benchmark]: TraceAbstraction took 37876.75ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 92.2MB in the beginning and 1.1GB in the end (delta: -984.9MB). Peak memory consumption was 346.8MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,929 INFO L158 Benchmark]: Witness Printer took 41.30ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:40:30,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.10ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 117.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.37ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 172.0MB. Free memory was 115.3MB in the beginning and 112.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 600.70ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 93.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37876.75ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 92.2MB in the beginning and 1.1GB in the end (delta: -984.9MB). Peak memory consumption was 346.8MB. Max. memory is 16.1GB. * Witness Printer took 41.30ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1050]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1005] SLL* null = malloc(sizeof(SLL)); [L1006] null->colour = BLACK [L1007] null->next = ((void*)0) [L1009] SLL* list = malloc(sizeof(SLL)); [L1010] list->next = null [L1011] list->colour = BLACK [L1013] SLL* end = list; VAL [end={-1:0}, list={-1:0}, null={-2:0}] [L1016] COND TRUE __VERIFIER_nondet_int() [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1023] COND FALSE !(__VERIFIER_nondet_int()) [L1029] end->colour = RED [L1030] end->next = malloc(sizeof(SLL)) [L1031] EXPR end->next [L1031] end = end->next [L1032] end->next = null [L1033] end->colour = BLACK [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-1:0}, list={-1:0}, null={-2:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, null={-2:0}] [L1042] EXPR end->colour [L1042] COND FALSE !(!(BLACK == end->colour)) [L1044] COND TRUE null != end [L1046] EXPR end->colour [L1046] COND FALSE !(RED == end->colour) [L1053] EXPR end->next [L1053] end = end->next [L1044] COND TRUE null != end [L1046] EXPR end->colour [L1046] COND TRUE RED == end->colour [L1048] EXPR end->next [L1048] end = end->next [L1049] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, null={-2:0}] [L1050] EXPR end->colour [L1050] COND TRUE !(BLACK != end->colour) [L1050] reach_error() VAL [end={-4:0}, list={-1:0}, null={-2:0}] - UnprovableResult [Line: 1041]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 852 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 687 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 165 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 106 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 33.7s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 215 ConstructedInterpolants, 22 QuantifiedInterpolants, 4880 SizeOfPredicates, 34 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 01:40:31,141 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 01:40:31,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE