./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/ldv-regression/ex3_forlist.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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:24:03,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:24:03,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:24:03,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:24:03,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:24:03,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:24:03,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:24:03,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:24:03,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:24:03,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:24:03,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:24:03,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:24:03,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:24:03,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:24:03,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:24:03,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:24:03,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:24:03,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:03,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:24:03,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2025-03-08 04:24:03,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:24:03,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:24:03,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:24:03,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:24:03,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:24:03,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-08 04:24:04,905 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d904e80/5d3f16a61e064da0bdd252c07badfac5/FLAG800242af3 [2025-03-08 04:24:05,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:24:05,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-03-08 04:24:05,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d904e80/5d3f16a61e064da0bdd252c07badfac5/FLAG800242af3 [2025-03-08 04:24:05,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d904e80/5d3f16a61e064da0bdd252c07badfac5 [2025-03-08 04:24:05,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:24:05,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:24:05,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:05,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:24:05,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:24:05,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b9c8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05, skipping insertion in model container [2025-03-08 04:24:05,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:24:05,545 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/ldv-regression/ex3_forlist.i[293,306] [2025-03-08 04:24:05,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:05,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:24:05,575 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/ldv-regression/ex3_forlist.i[293,306] [2025-03-08 04:24:05,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:05,592 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:24:05,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05 WrapperNode [2025-03-08 04:24:05,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:05,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:05,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:24:05,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:24:05,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,618 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-03-08 04:24:05,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:05,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:24:05,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:24:05,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:24:05,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,637 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 0, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 0, 2, 2]. The 5 writes are split as follows [0, 0, 2, 3]. [2025-03-08 04:24:05,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:24:05,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:24:05,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:24:05,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:24:05,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (1/1) ... [2025-03-08 04:24:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:05,673 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) [2025-03-08 04:24:05,675 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 [2025-03-08 04:24:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:24:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 04:24:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-03-08 04:24:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2025-03-08 04:24:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:24:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:24:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:24:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 04:24:05,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:24:05,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:24:05,813 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~post10; [2025-03-08 04:24:05,917 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 04:24:05,917 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:24:05,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:24:05,925 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:24:05,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:05 BoogieIcfgContainer [2025-03-08 04:24:05,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:24:05,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:24:05,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:24:05,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:24:05,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:24:05" (1/3) ... [2025-03-08 04:24:05,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363ae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:05, skipping insertion in model container [2025-03-08 04:24:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:05" (2/3) ... [2025-03-08 04:24:05,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363ae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:05, skipping insertion in model container [2025-03-08 04:24:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:05" (3/3) ... [2025-03-08 04:24:05,933 INFO L128 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2025-03-08 04:24:05,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:24:05,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ex3_forlist.i that has 4 procedures, 36 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 04:24:05,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:24:05,982 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;@7e49dafa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:24:05,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:24:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:24:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:24:05,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:05,990 INFO L218 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, 1] [2025-03-08 04:24:05,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:05,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 10122438, now seen corresponding path program 1 times [2025-03-08 04:24:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888682959] [2025-03-08 04:24:06,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:06,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:24:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:24:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888682959] [2025-03-08 04:24:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888682959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:24:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:24:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976518410] [2025-03-08 04:24:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:24:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:06,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:24:06,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:24:06,199 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:06,218 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2025-03-08 04:24:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:24:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2025-03-08 04:24:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:06,224 INFO L225 Difference]: With dead ends: 69 [2025-03-08 04:24:06,225 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:24:06,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:24:06,229 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:06,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:24:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 04:24:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-08 04:24:06,251 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 31 [2025-03-08 04:24:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:06,251 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-08 04:24:06,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-08 04:24:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:24:06,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:06,252 INFO L218 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, 1, 1] [2025-03-08 04:24:06,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:24:06,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:06,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 938101759, now seen corresponding path program 1 times [2025-03-08 04:24:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554161888] [2025-03-08 04:24:06,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:24:06,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:24:06,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554161888] [2025-03-08 04:24:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554161888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379981939] [2025-03-08 04:24:06,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:06,388 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) [2025-03-08 04:24:06,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:24:06,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 04:24:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:24:06,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:06,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 04:24:06,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:24:06,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:24:06,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379981939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:06,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:24:06,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 04:24:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812137834] [2025-03-08 04:24:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:24:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:06,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:24:06,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:06,542 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:24:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:06,560 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2025-03-08 04:24:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:24:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-08 04:24:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:06,563 INFO L225 Difference]: With dead ends: 52 [2025-03-08 04:24:06,563 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:24:06,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:06,564 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:06,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:24:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-08 04:24:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-08 04:24:06,570 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 32 [2025-03-08 04:24:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-08 04:24:06,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:24:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-08 04:24:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:24:06,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:06,573 INFO L218 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] [2025-03-08 04:24:06,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:24:06,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:06,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2112098051, now seen corresponding path program 1 times [2025-03-08 04:24:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:06,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886031334] [2025-03-08 04:24:06,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:06,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:06,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:24:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:24:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886031334] [2025-03-08 04:24:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886031334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917023357] [2025-03-08 04:24:06,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:06,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:06,889 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) [2025-03-08 04:24:06,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:24:06,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:24:06,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:24:06,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:06,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:06,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:24:06,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:07,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:07,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917023357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:07,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:07,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:24:07,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555383139] [2025-03-08 04:24:07,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:07,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:24:07,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:07,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:24:07,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:07,061 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 04:24:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:07,077 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2025-03-08 04:24:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:24:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 34 [2025-03-08 04:24:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:07,079 INFO L225 Difference]: With dead ends: 63 [2025-03-08 04:24:07,080 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:24:07,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:07,081 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:07,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:24:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 04:24:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-08 04:24:07,088 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 34 [2025-03-08 04:24:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:07,089 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-08 04:24:07,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 04:24:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-08 04:24:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:24:07,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:07,091 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 04:24:07,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:24:07,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 04:24:07,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:07,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 910336804, now seen corresponding path program 2 times [2025-03-08 04:24:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860417469] [2025-03-08 04:24:07,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:24:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:07,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-08 04:24:07,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 35 statements. [2025-03-08 04:24:07,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 04:24:07,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:07,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860417469] [2025-03-08 04:24:07,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860417469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:07,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:24:07,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 04:24:07,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908572003] [2025-03-08 04:24:07,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:07,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:24:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:07,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:24:07,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:24:07,625 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:07,753 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-03-08 04:24:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:24:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-03-08 04:24:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:07,756 INFO L225 Difference]: With dead ends: 71 [2025-03-08 04:24:07,756 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 04:24:07,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:24:07,756 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:07,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:24:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 04:24:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-03-08 04:24:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 04:24:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-03-08 04:24:07,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 35 [2025-03-08 04:24:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:07,768 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-03-08 04:24:07,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-03-08 04:24:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:24:07,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:07,769 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-08 04:24:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:24:07,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1997683386, now seen corresponding path program 1 times [2025-03-08 04:24:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744761077] [2025-03-08 04:24:07,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:07,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:24:07,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:24:07,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:07,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744761077] [2025-03-08 04:24:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744761077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608730229] [2025-03-08 04:24:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:07,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:07,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:07,840 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) [2025-03-08 04:24:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:24:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:24:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:24:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:07,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:24:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:24:07,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608730229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:07,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:07,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 04:24:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194610249] [2025-03-08 04:24:07,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:07,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:24:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:07,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:24:07,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:07,973 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:24:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:07,990 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2025-03-08 04:24:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:24:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-03-08 04:24:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:07,991 INFO L225 Difference]: With dead ends: 89 [2025-03-08 04:24:07,991 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 04:24:07,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:07,992 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:07,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 04:24:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 04:24:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 04:24:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2025-03-08 04:24:08,013 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 37 [2025-03-08 04:24:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:08,013 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2025-03-08 04:24:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:24:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2025-03-08 04:24:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:24:08,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:08,014 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-08 04:24:08,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:24:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:08,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:08,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1444399330, now seen corresponding path program 1 times [2025-03-08 04:24:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147217692] [2025-03-08 04:24:08,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:08,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:24:08,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:24:08,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:08,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:24:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147217692] [2025-03-08 04:24:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147217692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529914736] [2025-03-08 04:24:08,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:08,628 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) [2025-03-08 04:24:08,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:24:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:24:08,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:24:08,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:08,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:24:08,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:08,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 04:24:08,960 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 [2025-03-08 04:24:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:09,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:09,277 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 14 treesize of output 12 [2025-03-08 04:24:09,280 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 18 treesize of output 16 [2025-03-08 04:24:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529914736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:09,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2025-03-08 04:24:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113573969] [2025-03-08 04:24:09,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 04:24:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 04:24:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 04:24:09,444 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-08 04:24:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:10,357 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-03-08 04:24:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:24:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 38 [2025-03-08 04:24:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:10,359 INFO L225 Difference]: With dead ends: 108 [2025-03-08 04:24:10,359 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 04:24:10,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=2224, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 04:24:10,360 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 184 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:10,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 138 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 04:24:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 04:24:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-08 04:24:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 61 states have internal predecessors, (76), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-08 04:24:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2025-03-08 04:24:10,378 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 38 [2025-03-08 04:24:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:10,378 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2025-03-08 04:24:10,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 28 states have internal predecessors, (65), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-08 04:24:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2025-03-08 04:24:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 04:24:10,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:10,379 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-08 04:24:10,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:24:10,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:10,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:10,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1522235742, now seen corresponding path program 1 times [2025-03-08 04:24:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193782602] [2025-03-08 04:24:10,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:10,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:24:10,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:24:10,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:10,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193782602] [2025-03-08 04:24:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193782602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163453784] [2025-03-08 04:24:11,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:11,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:11,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:24:11,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:24:11,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:24:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:11,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 04:24:11,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:11,158 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 [2025-03-08 04:24:11,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:11,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 04:24:11,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:11,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:11,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-08 04:24:11,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:11,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:11,752 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-08 04:24:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 04:24:11,794 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 [2025-03-08 04:24:11,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 04:24:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:11,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:16,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 04:24:16,569 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 48 treesize of output 46 [2025-03-08 04:24:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163453784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:16,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:16,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 48 [2025-03-08 04:24:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969933957] [2025-03-08 04:24:16,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:16,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 04:24:16,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:16,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 04:24:16,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2075, Unknown=9, NotChecked=0, Total=2256 [2025-03-08 04:24:16,632 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 04:24:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:18,883 INFO L93 Difference]: Finished difference Result 186 states and 232 transitions. [2025-03-08 04:24:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 04:24:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 39 [2025-03-08 04:24:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:18,885 INFO L225 Difference]: With dead ends: 186 [2025-03-08 04:24:18,885 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 04:24:18,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=785, Invalid=6862, Unknown=9, NotChecked=0, Total=7656 [2025-03-08 04:24:18,889 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 236 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 84 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 152 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2602 Invalid, 8 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 04:24:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 04:24:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2025-03-08 04:24:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 80 states have internal predecessors, (99), 12 states have call successors, (12), 10 states have call predecessors, (12), 12 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-08 04:24:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-03-08 04:24:18,911 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 39 [2025-03-08 04:24:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:18,912 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-03-08 04:24:18,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 37 states have internal predecessors, (71), 10 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 04:24:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-03-08 04:24:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:24:18,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:18,915 INFO L218 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, 1, 1] [2025-03-08 04:24:18,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:24:19,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:19,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1049586397, now seen corresponding path program 1 times [2025-03-08 04:24:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814332898] [2025-03-08 04:24:19,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:19,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 04:24:19,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814332898] [2025-03-08 04:24:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814332898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051551676] [2025-03-08 04:24:19,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:19,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:19,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:19,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:24:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 04:24:19,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:19,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:19,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:19,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 04:24:19,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:19,904 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 [2025-03-08 04:24:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:20,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:20,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:24:20,245 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 20 treesize of output 16 [2025-03-08 04:24:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051551676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:20,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 46 [2025-03-08 04:24:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007394539] [2025-03-08 04:24:20,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 04:24:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 04:24:20,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 04:24:20,410 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 04:24:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:21,208 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2025-03-08 04:24:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:24:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2025-03-08 04:24:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:21,210 INFO L225 Difference]: With dead ends: 171 [2025-03-08 04:24:21,210 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 04:24:21,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=3355, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 04:24:21,211 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:21,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 141 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:24:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 04:24:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-03-08 04:24:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.25) internal successors, (130), 109 states have internal predecessors, (130), 14 states have call successors, (14), 12 states have call predecessors, (14), 16 states have return successors, (19), 13 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-08 04:24:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2025-03-08 04:24:21,232 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 40 [2025-03-08 04:24:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2025-03-08 04:24:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 1.8) internal successors, (72), 32 states have internal predecessors, (72), 11 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 04:24:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2025-03-08 04:24:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:24:21,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:21,237 INFO L218 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, 1, 1] [2025-03-08 04:24:21,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:24:21,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:21,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 593587363, now seen corresponding path program 2 times [2025-03-08 04:24:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368088237] [2025-03-08 04:24:21,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:24:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:21,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:24:21,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:21,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:24:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:24:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368088237] [2025-03-08 04:24:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368088237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755107362] [2025-03-08 04:24:21,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:24:21,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:21,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:21,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:21,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:24:22,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:24:22,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:22,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:24:22,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:22,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 04:24:22,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:22,068 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 [2025-03-08 04:24:22,088 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 [2025-03-08 04:24:22,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:22,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 04:24:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:22,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 04:24:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:22,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2025-03-08 04:24:22,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:22,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:22,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 17 treesize of output 7 [2025-03-08 04:24:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:22,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:22,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2025-03-08 04:24:22,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-03-08 04:24:22,654 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 43 treesize of output 41 [2025-03-08 04:24:22,656 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 34 treesize of output 32 [2025-03-08 04:24:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:24:22,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755107362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:22,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2025-03-08 04:24:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987606014] [2025-03-08 04:24:22,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 04:24:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:22,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 04:24:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-03-08 04:24:22,675 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 04:24:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:23,407 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2025-03-08 04:24:23,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:24:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 40 [2025-03-08 04:24:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:23,408 INFO L225 Difference]: With dead ends: 206 [2025-03-08 04:24:23,408 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 04:24:23,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 04:24:23,409 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:23,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 142 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:24:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 04:24:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-03-08 04:24:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 90 states have internal predecessors, (106), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-08 04:24:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2025-03-08 04:24:23,420 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 40 [2025-03-08 04:24:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:23,421 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2025-03-08 04:24:23,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 6 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 04:24:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2025-03-08 04:24:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:24:23,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:23,422 INFO L218 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, 1, 1, 1] [2025-03-08 04:24:23,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:23,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:23,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1619380331, now seen corresponding path program 1 times [2025-03-08 04:24:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471485383] [2025-03-08 04:24:23,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:23,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:24:23,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:24:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:24:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471485383] [2025-03-08 04:24:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471485383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496468899] [2025-03-08 04:24:23,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:23,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:23,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:23,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:23,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 04:24:23,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:24:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:24:24,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:24,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 04:24:24,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:24,057 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 [2025-03-08 04:24:24,186 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 [2025-03-08 04:24:24,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:24,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 04:24:24,266 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 [2025-03-08 04:24:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:24:24,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:24,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-08 04:24:24,667 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 22 treesize of output 18 [2025-03-08 04:24:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:24:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496468899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:24,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 16] total 42 [2025-03-08 04:24:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590010607] [2025-03-08 04:24:24,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:24,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 04:24:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:24,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 04:24:24,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1562, Unknown=14, NotChecked=0, Total=1722 [2025-03-08 04:24:24,723 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 04:24:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:25,586 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2025-03-08 04:24:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 04:24:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 41 [2025-03-08 04:24:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:25,587 INFO L225 Difference]: With dead ends: 161 [2025-03-08 04:24:25,587 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 04:24:25,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=3236, Unknown=14, NotChecked=0, Total=3660 [2025-03-08 04:24:25,588 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:25,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 124 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:24:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 04:24:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 84. [2025-03-08 04:24:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 04:24:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2025-03-08 04:24:25,598 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 41 [2025-03-08 04:24:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:25,599 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2025-03-08 04:24:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 34 states have internal predecessors, (82), 6 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 04:24:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2025-03-08 04:24:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 04:24:25,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:25,599 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2025-03-08 04:24:25,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 04:24:25,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1324960939, now seen corresponding path program 1 times [2025-03-08 04:24:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789269619] [2025-03-08 04:24:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:25,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 04:24:25,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 04:24:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:24:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789269619] [2025-03-08 04:24:25,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789269619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102026460] [2025-03-08 04:24:25,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:25,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 04:24:25,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 04:24:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 04:24:25,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:25,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:24:25,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:24:25,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:24:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102026460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:24:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 04:24:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208325794] [2025-03-08 04:24:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:24:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:25,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:24:25,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:25,976 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:25,999 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2025-03-08 04:24:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:24:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-03-08 04:24:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:26,000 INFO L225 Difference]: With dead ends: 120 [2025-03-08 04:24:26,000 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 04:24:26,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:26,001 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:26,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 04:24:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-03-08 04:24:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 04:24:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-03-08 04:24:26,012 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 46 [2025-03-08 04:24:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:26,013 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-03-08 04:24:26,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 04:24:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-03-08 04:24:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 04:24:26,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:26,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:26,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:26,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1153485012, now seen corresponding path program 1 times [2025-03-08 04:24:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952558314] [2025-03-08 04:24:26,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:26,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 04:24:26,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 04:24:26,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:26,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952558314] [2025-03-08 04:24:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952558314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53479519] [2025-03-08 04:24:27,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:27,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:27,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:27,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:27,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 04:24:27,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 04:24:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 04:24:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:27,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 04:24:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:24:27,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:28,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 04:24:28,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:28,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-03-08 04:24:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 04:24:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53479519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:28,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 16] total 62 [2025-03-08 04:24:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065732136] [2025-03-08 04:24:28,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:28,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-08 04:24:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:28,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-08 04:24:28,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3580, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 04:24:28,446 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-08 04:24:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:30,649 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-03-08 04:24:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 04:24:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 50 [2025-03-08 04:24:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:30,650 INFO L225 Difference]: With dead ends: 91 [2025-03-08 04:24:30,650 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 04:24:30,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=687, Invalid=8433, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 04:24:30,652 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 256 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:30,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 99 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 04:24:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 04:24:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-03-08 04:24:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 56 states have internal predecessors, (59), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-08 04:24:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-03-08 04:24:30,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 50 [2025-03-08 04:24:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-03-08 04:24:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 44 states have internal predecessors, (97), 14 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-08 04:24:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-03-08 04:24:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 04:24:30,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:30,661 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1] [2025-03-08 04:24:30,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 04:24:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 04:24:30,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:30,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1195096040, now seen corresponding path program 1 times [2025-03-08 04:24:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671546933] [2025-03-08 04:24:30,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:30,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 04:24:30,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 04:24:30,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:30,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:24:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671546933] [2025-03-08 04:24:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671546933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501226706] [2025-03-08 04:24:31,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:31,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:31,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:31,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 04:24:31,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 04:24:31,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 04:24:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:31,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:24:31,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:31,249 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 [2025-03-08 04:24:31,255 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 [2025-03-08 04:24:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:24:31,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:24:31,399 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 16 treesize of output 12 [2025-03-08 04:24:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:24:31,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501226706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:31,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:31,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2025-03-08 04:24:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362253738] [2025-03-08 04:24:31,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 04:24:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:31,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 04:24:31,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-08 04:24:31,410 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 04:24:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:31,662 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2025-03-08 04:24:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 04:24:31,663 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 51 [2025-03-08 04:24:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:31,663 INFO L225 Difference]: With dead ends: 87 [2025-03-08 04:24:31,663 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 04:24:31,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-08 04:24:31,664 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:31,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 279 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:24:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 04:24:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 04:24:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-03-08 04:24:31,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2025-03-08 04:24:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:31,684 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-03-08 04:24:31,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 4 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 04:24:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-03-08 04:24:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 04:24:31,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:31,685 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:31,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 04:24:31,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 04:24:31,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:31,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash -527309078, now seen corresponding path program 1 times [2025-03-08 04:24:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:31,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022796696] [2025-03-08 04:24:31,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 04:24:31,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 04:24:31,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 04:24:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022796696] [2025-03-08 04:24:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022796696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584958026] [2025-03-08 04:24:32,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:32,238 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 04:24:32,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 04:24:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 04:24:32,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:32,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:32,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 04:24:32,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:32,388 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 [2025-03-08 04:24:32,570 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 [2025-03-08 04:24:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:24:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 04:24:32,657 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 [2025-03-08 04:24:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:24:32,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:33,312 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 19 treesize of output 17 [2025-03-08 04:24:33,315 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 26 treesize of output 22 [2025-03-08 04:24:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:24:33,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584958026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:33,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:33,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 19] total 52 [2025-03-08 04:24:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173669587] [2025-03-08 04:24:33,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:33,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 04:24:33,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:33,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 04:24:33,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2420, Unknown=21, NotChecked=0, Total=2652 [2025-03-08 04:24:33,383 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 04:24:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:34,133 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2025-03-08 04:24:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:24:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) Word has length 54 [2025-03-08 04:24:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:34,133 INFO L225 Difference]: With dead ends: 55 [2025-03-08 04:24:34,133 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:24:34,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=514, Invalid=4021, Unknown=21, NotChecked=0, Total=4556 [2025-03-08 04:24:34,135 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:34,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 78 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:24:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:24:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:24:34,137 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) [2025-03-08 04:24:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:24:34,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-03-08 04:24:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:34,137 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:24:34,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 43 states have internal predecessors, (104), 8 states have call successors, (18), 11 states have call predecessors, (18), 12 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 04:24:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:24:34,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:24:34,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:24:34,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 04:24:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 04:24:34,343 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:34,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:24:36,714 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,723 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,724 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,726 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-03-08 04:24:36,727 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,728 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,731 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,731 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,731 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,732 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-03-08 04:24:36,733 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,734 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,734 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,734 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,734 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,734 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,735 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-03-08 04:24:36,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,737 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-03-08 04:24:36,738 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-03-08 04:24:36,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:24:36 BoogieIcfgContainer [2025-03-08 04:24:36,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:24:36,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:24:36,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:24:36,739 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:24:36,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:05" (3/4) ... [2025-03-08 04:24:36,743 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:24:36,747 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-03-08 04:24:36,747 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure g [2025-03-08 04:24:36,747 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2025-03-08 04:24:36,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-08 04:24:36,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 04:24:36,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:24:36,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:24:36,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:24:36,806 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:24:36,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:24:36,807 INFO L158 Benchmark]: Toolchain (without parser) took 31351.69ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 104.9MB in the beginning and 235.7MB in the end (delta: -130.8MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,808 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:36,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.64ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 93.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.96ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:36,809 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,809 INFO L158 Benchmark]: IcfgBuilder took 276.09ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 75.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,809 INFO L158 Benchmark]: TraceAbstraction took 30811.12ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 75.7MB in the beginning and 240.2MB in the end (delta: -164.4MB). Peak memory consumption was 173.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,809 INFO L158 Benchmark]: Witness Printer took 67.20ms. Allocated memory is still 343.9MB. Free memory was 240.2MB in the beginning and 235.7MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:36,810 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.64ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 93.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.96ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 276.09ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 75.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30811.12ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 75.7MB in the beginning and 240.2MB in the end (delta: -164.4MB). Peak memory consumption was 173.4MB. Max. memory is 16.1GB. * Witness Printer took 67.20ms. Allocated memory is still 343.9MB. Free memory was 240.2MB in the beginning and 235.7MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset * 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: 8]: 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 4 procedures, 36 locations, 51 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1347 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1342 mSDsluCounter, 1777 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1440 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10113 IncrementalHoareTripleChecker+Invalid, 10562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 337 mSDtfsCounter, 10113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1260 GetRequests, 737 SyntacticMatches, 14 SemanticMatches, 509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7468 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=8, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 157 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1458 ConstructedInterpolants, 48 QuantifiedInterpolants, 10130 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3660 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 437/728 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((1 <= counter) || (1 <= counter)) || (1 <= counter)) || (1 <= counter)) - InvariantResult [Line: 19]: Location Invariant Derived location invariant: (((i == 0) && (counter == 1)) || ((1 <= i) && (counter == 1))) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((1 <= counter) || (1 <= counter)) && ((i == 0) || (1 <= i))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:24:36,837 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