./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:07:16,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:07:16,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:07:16,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:07:16,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:07:16,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:07:16,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:07:16,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:07:16,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:07:16,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:07:16,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:07:16,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:07:16,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:07:16,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:07:16,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:07:16,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:07:16,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:07:16,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:07:16,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:07:16,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:07:16,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:07:16,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:07:16,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:07:16,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:07:16,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:07:16,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:07:16,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:07:16,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:07:16,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:07:16,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:07:16,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:07:16,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:07:16,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:16,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:07:16,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:07:16,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:07:16,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:07:16,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:07:16,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:07:16,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:07:16,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:07:16,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:07:16,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-09 22:07:17,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:07:17,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:07:17,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:07:17,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:07:17,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:07:17,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-09 22:07:18,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:07:18,697 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:07:18,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-09 22:07:18,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a596f345c/2cbf19de6f0d492b99ce91cac8d11783/FLAGc9b5310c0 [2024-11-09 22:07:19,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a596f345c/2cbf19de6f0d492b99ce91cac8d11783 [2024-11-09 22:07:19,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:07:19,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:07:19,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:19,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:07:19,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:07:19,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714fb149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19, skipping insertion in model container [2024-11-09 22:07:19,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:07:19,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-09 22:07:19,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:19,451 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:07:19,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-09 22:07:19,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:07:19,527 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:07:19,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19 WrapperNode [2024-11-09 22:07:19,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:07:19,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:19,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:07:19,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:07:19,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,572 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104 [2024-11-09 22:07:19,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:07:19,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:07:19,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:07:19,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:07:19,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,604 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-09 22:07:19,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:07:19,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:07:19,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:07:19,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:07:19,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (1/1) ... [2024-11-09 22:07:19,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:07:19,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:19,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:07:19,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:07:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:07:19,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:07:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:07:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:07:19,713 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:07:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:07:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:07:19,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:07:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:07:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:07:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:07:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:07:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:07:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:07:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:07:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:07:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:07:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:07:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:07:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:07:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:07:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:07:19,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:07:19,911 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:07:19,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:07:20,086 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:07:20,121 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:07:20,141 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-09 22:07:20,141 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:07:20,157 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:07:20,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:07:20,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:20 BoogieIcfgContainer [2024-11-09 22:07:20,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:07:20,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:07:20,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:07:20,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:07:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:07:19" (1/3) ... [2024-11-09 22:07:20,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f04f017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:20, skipping insertion in model container [2024-11-09 22:07:20,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:07:19" (2/3) ... [2024-11-09 22:07:20,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f04f017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:07:20, skipping insertion in model container [2024-11-09 22:07:20,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:20" (3/3) ... [2024-11-09 22:07:20,170 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2024-11-09 22:07:20,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:07:20,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:07:20,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:07:20,238 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;@5166066b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:07:20,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:07:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:07:20,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:20,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:20,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:20,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 3518330, now seen corresponding path program 1 times [2024-11-09 22:07:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435353486] [2024-11-09 22:07:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:07:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435353486] [2024-11-09 22:07:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435353486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:07:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492710224] [2024-11-09 22:07:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:07:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:07:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:07:20,602 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:07:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:20,663 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-11-09 22:07:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:07:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 22:07:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:20,672 INFO L225 Difference]: With dead ends: 45 [2024-11-09 22:07:20,673 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 22:07:20,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:07:20,679 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:20,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 22:07:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 22:07:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-09 22:07:20,707 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2024-11-09 22:07:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-09 22:07:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:07:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-09 22:07:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:07:20,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:20,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:07:20,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:20,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1637628413, now seen corresponding path program 1 times [2024-11-09 22:07:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179310128] [2024-11-09 22:07:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:07:20,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:20,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179310128] [2024-11-09 22:07:20,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179310128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:20,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:20,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:07:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014748772] [2024-11-09 22:07:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:20,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:07:20,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:07:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:07:20,957 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:07:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:21,003 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 22:07:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:07:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 22:07:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:21,005 INFO L225 Difference]: With dead ends: 43 [2024-11-09 22:07:21,006 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:07:21,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:07:21,007 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:21,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:07:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-09 22:07:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 22:07:21,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2024-11-09 22:07:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:21,019 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 22:07:21,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:07:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 22:07:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 22:07:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:21,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:07:21,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -180263985, now seen corresponding path program 1 times [2024-11-09 22:07:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495731669] [2024-11-09 22:07:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:21,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495731669] [2024-11-09 22:07:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495731669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:07:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000396554] [2024-11-09 22:07:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:07:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:07:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:07:21,300 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:07:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:21,363 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-09 22:07:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:07:21,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 22:07:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:21,365 INFO L225 Difference]: With dead ends: 37 [2024-11-09 22:07:21,365 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 22:07:21,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:07:21,367 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:21,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:07:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 22:07:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-09 22:07:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-09 22:07:21,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 30 [2024-11-09 22:07:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-09 22:07:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:07:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-09 22:07:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:07:21,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:21,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:21,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:07:21,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:21,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 962078700, now seen corresponding path program 1 times [2024-11-09 22:07:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538528908] [2024-11-09 22:07:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538528908] [2024-11-09 22:07:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538528908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639474577] [2024-11-09 22:07:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:21,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:21,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:07:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:21,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 22:07:21,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:21,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:07:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639474577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:22,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 22:07:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285343557] [2024-11-09 22:07:22,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:22,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:07:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:07:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:07:22,018 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:07:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:22,084 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 22:07:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:07:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-09 22:07:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:22,086 INFO L225 Difference]: With dead ends: 39 [2024-11-09 22:07:22,086 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:07:22,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:07:22,088 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:22,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:07:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:07:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 22:07:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 22:07:22,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 34 [2024-11-09 22:07:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 22:07:22,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:07:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 22:07:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:07:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:22,097 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:22,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:07:22,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:22,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:22,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1308988809, now seen corresponding path program 2 times [2024-11-09 22:07:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:22,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828358026] [2024-11-09 22:07:22,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:07:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828358026] [2024-11-09 22:07:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828358026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394571609] [2024-11-09 22:07:24,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:07:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:24,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:24,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:07:24,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:07:24,718 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:07:24,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-09 22:07:24,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:24,958 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-11-09 22:07:24,968 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-11-09 22:07:25,115 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 22:07:25,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 29 [2024-11-09 22:07:25,134 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 22:07:25,135 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 1 case distinctions, treesize of input 62 treesize of output 28 [2024-11-09 22:07:25,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 70 [2024-11-09 22:07:25,470 INFO L349 Elim1Store]: treesize reduction 116, result has 4.1 percent of original size [2024-11-09 22:07:25,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 117 [2024-11-09 22:07:25,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 182 [2024-11-09 22:07:25,780 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-11-09 22:07:25,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:25,821 INFO L349 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2024-11-09 22:07:25,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1264 treesize of output 1105 [2024-11-09 22:07:25,893 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 533 treesize of output 509 [2024-11-09 22:07:25,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:25,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:25,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2024-11-09 22:07:26,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 22:07:26,104 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 24 treesize of output 18 [2024-11-09 22:07:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:07:26,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:26,542 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 455 treesize of output 335 [2024-11-09 22:07:26,548 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 339 treesize of output 235 [2024-11-09 22:07:26,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse6 (select .cse5 .cse4)) (.cse7 (+ (select .cse3 .cse4) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) .cse7)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7))) (and (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse3 .cse4 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse4)) (forall ((v_ArrVal_569 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_569) .cse1 (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store .cse5 .cse4 .cse1)) .cse1) .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse4))))))) is different from false [2024-11-09 22:07:26,953 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 2646 treesize of output 2622 [2024-11-09 22:07:27,382 INFO L349 Elim1Store]: treesize reduction 512, result has 28.8 percent of original size [2024-11-09 22:07:27,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 4861 treesize of output 2228 [2024-11-09 22:07:27,643 INFO L349 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2024-11-09 22:07:27,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 466 treesize of output 454 [2024-11-09 22:07:27,712 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-09 22:07:27,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 341 treesize of output 311 [2024-11-09 22:07:27,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:27,782 INFO L349 Elim1Store]: treesize reduction 35, result has 38.6 percent of original size [2024-11-09 22:07:27,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 63 [2024-11-09 22:07:27,888 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 22:07:27,889 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 17 treesize of output 9 [2024-11-09 22:07:27,913 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 8 treesize of output 4 [2024-11-09 22:07:27,935 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 12 treesize of output 8 [2024-11-09 22:07:27,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:27,954 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 25 treesize of output 25 [2024-11-09 22:07:27,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:27,999 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 22 treesize of output 22 [2024-11-09 22:07:28,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:28,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2024-11-09 22:07:28,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:28,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 73 [2024-11-09 22:07:28,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:07:28,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 131 [2024-11-09 22:07:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132 [2024-11-09 22:07:28,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,426 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:07:28,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2024-11-09 22:07:28,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,489 INFO L349 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2024-11-09 22:07:28,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 244 [2024-11-09 22:07:28,495 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 8 treesize of output 4 [2024-11-09 22:07:28,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,551 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-09 22:07:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 183 treesize of output 271 [2024-11-09 22:07:28,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,595 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 22:07:28,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 154 [2024-11-09 22:07:28,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 115 [2024-11-09 22:07:28,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,634 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:07:28,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 61 [2024-11-09 22:07:28,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,645 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 77 treesize of output 49 [2024-11-09 22:07:28,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,658 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:07:28,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 45 [2024-11-09 22:07:28,666 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 45 treesize of output 29 [2024-11-09 22:07:28,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,678 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:07:28,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2024-11-09 22:07:28,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,689 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 22:07:28,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2024-11-09 22:07:28,697 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 8 treesize of output 4 [2024-11-09 22:07:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:07:28,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:07:28,709 INFO L349 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2024-11-09 22:07:28,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 1 [2024-11-09 22:07:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:07:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394571609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:28,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 10] total 36 [2024-11-09 22:07:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101903343] [2024-11-09 22:07:28,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 22:07:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 22:07:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1053, Unknown=8, NotChecked=66, Total=1260 [2024-11-09 22:07:28,775 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 36 states, 35 states have (on average 2.0) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 22:07:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:29,572 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-11-09 22:07:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:07:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-09 22:07:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:29,576 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:07:29,576 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 22:07:29,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=1108, Unknown=8, NotChecked=68, Total=1332 [2024-11-09 22:07:29,577 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:29,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 334 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 41 Unchecked, 0.7s Time] [2024-11-09 22:07:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 22:07:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-09 22:07:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:07:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-11-09 22:07:29,586 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 38 [2024-11-09 22:07:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:29,587 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-11-09 22:07:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 22:07:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-11-09 22:07:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:07:29,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:29,589 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:29,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:07:29,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:29,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:29,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash -433821526, now seen corresponding path program 1 times [2024-11-09 22:07:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491687123] [2024-11-09 22:07:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:29,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:07:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491687123] [2024-11-09 22:07:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491687123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:07:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:07:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190928489] [2024-11-09 22:07:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:30,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:07:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:07:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:07:30,020 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:07:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:30,091 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-09 22:07:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:07:30,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-09 22:07:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:30,093 INFO L225 Difference]: With dead ends: 61 [2024-11-09 22:07:30,093 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 22:07:30,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:30,094 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:30,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:07:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 22:07:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 22:07:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:07:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 22:07:30,099 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 38 [2024-11-09 22:07:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:30,099 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 22:07:30,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:07:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 22:07:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:07:30,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:30,100 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:30,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:07:30,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:30,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash 900164584, now seen corresponding path program 1 times [2024-11-09 22:07:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:30,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863106201] [2024-11-09 22:07:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:07:30,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863106201] [2024-11-09 22:07:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863106201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160872434] [2024-11-09 22:07:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:30,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:30,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:30,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:07:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:07:30,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:07:30,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:07:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 22:07:30,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160872434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:07:30,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:07:30,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-09 22:07:30,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010556344] [2024-11-09 22:07:30,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:07:30,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:07:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:07:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:30,451 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:30,520 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-09 22:07:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:07:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-11-09 22:07:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:30,524 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:07:30,524 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 22:07:30,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:07:30,524 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:30,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:07:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 22:07:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 22:07:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:07:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 22:07:30,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 38 [2024-11-09 22:07:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:30,536 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 22:07:30,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:07:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 22:07:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 22:07:30,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:07:30,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:07:30,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:07:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:30,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:07:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:07:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash -195582345, now seen corresponding path program 3 times [2024-11-09 22:07:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:07:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211672950] [2024-11-09 22:07:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:07:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:07:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:07:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:07:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:07:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:07:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 22:07:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:07:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211672950] [2024-11-09 22:07:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211672950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:07:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080010635] [2024-11-09 22:07:30,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:07:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:30,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:07:30,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:07:30,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:07:31,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 22:07:31,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:07:31,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:07:31,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:07:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 22:07:31,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:07:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080010635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:07:31,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:07:31,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 22:07:31,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659204879] [2024-11-09 22:07:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:07:31,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:07:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:07:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:07:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:07:31,138 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:07:31,153 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-09 22:07:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:07:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-11-09 22:07:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:07:31,157 INFO L225 Difference]: With dead ends: 45 [2024-11-09 22:07:31,157 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 22:07:31,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:07:31,158 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:07:31,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:07:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 22:07:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 22:07:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:07:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 22:07:31,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2024-11-09 22:07:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:07:31,162 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 22:07:31,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 22:07:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 22:07:31,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 22:07:31,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:07:31,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:07:31,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:07:31,369 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-09 22:07:31,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 22:07:31,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:07:31,560 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-09 22:07:31,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 22:07:31,571 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 22:07:31,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 22:07:31,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 22:07:31,573 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 22:07:31,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:07:31 BoogieIcfgContainer [2024-11-09 22:07:31,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:07:31,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:07:31,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:07:31,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:07:31,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:07:20" (3/4) ... [2024-11-09 22:07:31,578 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 22:07:31,582 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-09 22:07:31,586 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 22:07:31,586 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 22:07:31,586 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 22:07:31,586 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 22:07:31,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:07:31,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 22:07:31,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:07:31,678 INFO L158 Benchmark]: Toolchain (without parser) took 12619.01ms. Allocated memory was 151.0MB in the beginning and 333.4MB in the end (delta: 182.5MB). Free memory was 115.8MB in the beginning and 197.1MB in the end (delta: -81.3MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,678 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:07:31,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.19ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 95.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.74ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,678 INFO L158 Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,679 INFO L158 Benchmark]: IcfgBuilder took 537.78ms. Allocated memory is still 151.0MB. Free memory was 90.8MB in the beginning and 110.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,679 INFO L158 Benchmark]: TraceAbstraction took 11413.73ms. Allocated memory was 151.0MB in the beginning and 333.4MB in the end (delta: 182.5MB). Free memory was 109.3MB in the beginning and 202.3MB in the end (delta: -93.0MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,679 INFO L158 Benchmark]: Witness Printer took 102.43ms. Allocated memory is still 333.4MB. Free memory was 202.3MB in the beginning and 197.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 22:07:31,681 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.25ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.19ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 95.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.74ms. Allocated memory is still 151.0MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.21ms. Allocated memory is still 151.0MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 537.78ms. Allocated memory is still 151.0MB. Free memory was 90.8MB in the beginning and 110.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11413.73ms. Allocated memory was 151.0MB in the beginning and 333.4MB in the end (delta: 182.5MB). Free memory was 109.3MB in the beginning and 202.3MB in the end (delta: -93.0MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. * Witness Printer took 102.43ms. Allocated memory is still 333.4MB. Free memory was 202.3MB in the beginning and 197.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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 - PositiveResult [Line: 625]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 871 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 41 IncrementalHoareTripleChecker+Unchecked, 671 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 200 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=5, InterpolantAutomatonStates: 53, 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, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 422 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 517 ConstructedInterpolants, 11 QuantifiedInterpolants, 5876 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1322 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 177/205 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 588]: Location Invariant Derived location invariant: null - InvariantResult [Line: 618]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 22:07:31,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE