./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:38:09,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:38:09,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:38:09,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:38:09,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:38:09,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:38:09,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:38:09,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:38:09,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:38:09,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:38:09,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:38:09,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:38:09,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:38:09,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:38:09,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:38:09,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:38:09,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:09,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:38:09,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:38:09,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:38:09,893 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2025-03-04 14:38:10,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:10,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:10,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:10,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:10,141 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:10,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 14:38:11,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434e9b71/49b34c2d4b1148c592a0b22c01e90f2c/FLAG512b46a84 [2025-03-04 14:38:11,618 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:11,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 14:38:11,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434e9b71/49b34c2d4b1148c592a0b22c01e90f2c/FLAG512b46a84 [2025-03-04 14:38:11,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434e9b71/49b34c2d4b1148c592a0b22c01e90f2c [2025-03-04 14:38:11,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:11,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:11,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:11,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:11,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:11,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ce3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:11, skipping insertion in model container [2025-03-04 14:38:11,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:11" (1/1) ... [2025-03-04 14:38:11,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:12,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:12,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:12,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:12,472 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:12,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12 WrapperNode [2025-03-04 14:38:12,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:12,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:12,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:12,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:12,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,534 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 654 [2025-03-04 14:38:12,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:12,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:12,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:12,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:12,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,586 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 11, 4, 3, 44, 355, 2, 2, 6]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 0, 3, 3, 42, 355, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 1, 2, 2]. [2025-03-04 14:38:12,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:12,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:12,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:12,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:12,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:12,653 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-04 14:38:12,656 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-04 14:38:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:12,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:38:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:38:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:38:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:38:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:12,833 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:12,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:13,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-03-04 14:38:13,268 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:13,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:13,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:13,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:13,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:13 BoogieIcfgContainer [2025-03-04 14:38:13,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:13,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:13,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:13,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:13,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:11" (1/3) ... [2025-03-04 14:38:13,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42553d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:13, skipping insertion in model container [2025-03-04 14:38:13,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12" (2/3) ... [2025-03-04 14:38:13,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42553d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:13, skipping insertion in model container [2025-03-04 14:38:13,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:13" (3/3) ... [2025-03-04 14:38:13,281 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-03-04 14:38:13,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:13,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 90 locations, 1 initial locations, 6 loop locations, and 25 error locations. [2025-03-04 14:38:13,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:13,334 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;@18b81706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:13,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 14:38:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 87 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:13,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:13,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 4401087, now seen corresponding path program 1 times [2025-03-04 14:38:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539921026] [2025-03-04 14:38:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:13,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:13,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539921026] [2025-03-04 14:38:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539921026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126878874] [2025-03-04 14:38:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:13,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:13,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:13,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,802 INFO L87 Difference]: Start difference. First operand has 90 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 87 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 14:38:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:13,844 INFO L93 Difference]: Finished difference Result 167 states and 206 transitions. [2025-03-04 14:38:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:38:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:13,850 INFO L225 Difference]: With dead ends: 167 [2025-03-04 14:38:13,850 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 14:38:13,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,856 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:13,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 14:38:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 14:38:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 79 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2025-03-04 14:38:13,882 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 4 [2025-03-04 14:38:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:13,883 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2025-03-04 14:38:13,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 14:38:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2025-03-04 14:38:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:38:13,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,883 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:38:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:38:13,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:13,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2031126772, now seen corresponding path program 1 times [2025-03-04 14:38:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680638881] [2025-03-04 14:38:13,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:13,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:13,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680638881] [2025-03-04 14:38:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680638881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836040338] [2025-03-04 14:38:14,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:14,077 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-04 14:38:14,078 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-04 14:38:14,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:14,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:14,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:14,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:14,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836040338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283476920] [2025-03-04 14:38:14,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:14,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:14,347 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-04 14:38:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,376 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-03-04 14:38:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:38:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,377 INFO L225 Difference]: With dead ends: 82 [2025-03-04 14:38:14,378 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 14:38:14,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:14,379 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:14,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 14:38:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 14:38:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.631578947368421) internal successors, (93), 78 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2025-03-04 14:38:14,386 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 7 [2025-03-04 14:38:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,387 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-03-04 14:38:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-04 14:38:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2025-03-04 14:38:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:14,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:14,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:14,395 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-04 14:38:14,588 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-04 14:38:14,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1459579585, now seen corresponding path program 1 times [2025-03-04 14:38:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576034566] [2025-03-04 14:38:14,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:14,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:14,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:38:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576034566] [2025-03-04 14:38:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576034566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019461694] [2025-03-04 14:38:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:14,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:14,714 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 14:38:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,728 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-03-04 14:38:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:38:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,731 INFO L225 Difference]: With dead ends: 81 [2025-03-04 14:38:14,731 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 14:38:14,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:14,732 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:14,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 14:38:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-03-04 14:38:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 75 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-03-04 14:38:14,737 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 8 [2025-03-04 14:38:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,737 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-03-04 14:38:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 14:38:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-03-04 14:38:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:38:14,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:14,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:14,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:38:14,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:14,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1681727390, now seen corresponding path program 1 times [2025-03-04 14:38:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325775598] [2025-03-04 14:38:14,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:14,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:14,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:14,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325775598] [2025-03-04 14:38:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325775598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215807279] [2025-03-04 14:38:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:14,860 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-04 14:38:14,862 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-04 14:38:14,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:15,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:15,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:38:15,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215807279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:38:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418969578] [2025-03-04 14:38:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:15,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:15,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:15,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:15,105 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:15,128 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-03-04 14:38:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:38:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:15,129 INFO L225 Difference]: With dead ends: 78 [2025-03-04 14:38:15,129 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 14:38:15,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-04 14:38:15,129 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:15,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 89 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 14:38:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 14:38:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.6) internal successors, (88), 73 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-04 14:38:15,134 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 12 [2025-03-04 14:38:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 14:38:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-04 14:38:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:38:15,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:15,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:15,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:15,335 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,SelfDestructingSolverStorable3 [2025-03-04 14:38:15,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -593941467, now seen corresponding path program 1 times [2025-03-04 14:38:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018465803] [2025-03-04 14:38:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:15,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:15,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018465803] [2025-03-04 14:38:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018465803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308105304] [2025-03-04 14:38:15,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:15,450 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-04 14:38:15,452 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-04 14:38:15,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:15,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:15,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:15,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:15,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308105304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:15,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726991003] [2025-03-04 14:38:15,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:15,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:15,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:15,720 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:38:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:15,755 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2025-03-04 14:38:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:38:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:15,758 INFO L225 Difference]: With dead ends: 155 [2025-03-04 14:38:15,759 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 14:38:15,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:15,760 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:15,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 338 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 14:38:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 14:38:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.515625) internal successors, (97), 82 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2025-03-04 14:38:15,765 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 13 [2025-03-04 14:38:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:15,765 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2025-03-04 14:38:15,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:38:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2025-03-04 14:38:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:15,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:15,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:15,774 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-04 14:38:15,966 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-04 14:38:15,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -189852584, now seen corresponding path program 2 times [2025-03-04 14:38:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842603108] [2025-03-04 14:38:15,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:38:16,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:38:16,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:38:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842603108] [2025-03-04 14:38:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842603108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544057219] [2025-03-04 14:38:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:16,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:16,144 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,179 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-03-04 14:38:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:38:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,183 INFO L225 Difference]: With dead ends: 85 [2025-03-04 14:38:16,183 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 14:38:16,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:16,184 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:16,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 239 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 14:38:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 14:38:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.484375) internal successors, (95), 80 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2025-03-04 14:38:16,191 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 22 [2025-03-04 14:38:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,191 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2025-03-04 14:38:16,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2025-03-04 14:38:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:38:16,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:16,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:38:16,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:16,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1538501770, now seen corresponding path program 1 times [2025-03-04 14:38:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616777369] [2025-03-04 14:38:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:38:16,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:38:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:38:16,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616777369] [2025-03-04 14:38:16,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616777369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:16,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498511552] [2025-03-04 14:38:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:16,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:16,339 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,355 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2025-03-04 14:38:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:16,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:38:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,356 INFO L225 Difference]: With dead ends: 145 [2025-03-04 14:38:16,357 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 14:38:16,357 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-04 14:38:16,358 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:16,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 163 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 14:38:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 14:38:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.462686567164179) internal successors, (98), 83 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2025-03-04 14:38:16,362 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 27 [2025-03-04 14:38:16,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,362 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2025-03-04 14:38:16,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2025-03-04 14:38:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:16,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,363 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:38:16,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1915041553, now seen corresponding path program 1 times [2025-03-04 14:38:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853429594] [2025-03-04 14:38:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:16,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:16,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:38:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853429594] [2025-03-04 14:38:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853429594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:16,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369302754] [2025-03-04 14:38:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:16,476 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,498 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-03-04 14:38:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:38:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,499 INFO L225 Difference]: With dead ends: 99 [2025-03-04 14:38:16,499 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 14:38:16,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:16,500 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:16,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 160 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 14:38:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-03-04 14:38:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 92 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2025-03-04 14:38:16,509 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 30 [2025-03-04 14:38:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2025-03-04 14:38:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2025-03-04 14:38:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:16,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:16,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:38:16,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:16,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1915041713, now seen corresponding path program 1 times [2025-03-04 14:38:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750807296] [2025-03-04 14:38:16,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:16,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:16,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:38:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750807296] [2025-03-04 14:38:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750807296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489624560] [2025-03-04 14:38:16,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:16,637 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-04 14:38:16,639 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-04 14:38:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:16,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:16,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:38:16,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:38:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489624560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:16,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:38:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462785517] [2025-03-04 14:38:16,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:38:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:38:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:16,969 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:38:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,037 INFO L93 Difference]: Finished difference Result 192 states and 234 transitions. [2025-03-04 14:38:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:38:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:38:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,040 INFO L225 Difference]: With dead ends: 192 [2025-03-04 14:38:17,040 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 14:38:17,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:17,041 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 5 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:17,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 306 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 14:38:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 14:38:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.351063829787234) internal successors, (127), 109 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2025-03-04 14:38:17,053 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 30 [2025-03-04 14:38:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,054 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2025-03-04 14:38:17,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:38:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2025-03-04 14:38:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:38:17,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,054 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:17,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:17,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1006415884, now seen corresponding path program 1 times [2025-03-04 14:38:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513348842] [2025-03-04 14:38:17,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:38:17,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:38:17,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:38:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513348842] [2025-03-04 14:38:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513348842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551457487] [2025-03-04 14:38:17,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:17,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:17,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,385 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,399 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2025-03-04 14:38:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:17,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:38:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,400 INFO L225 Difference]: With dead ends: 112 [2025-03-04 14:38:17,401 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 14:38:17,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,402 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:17,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 14:38:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-03-04 14:38:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 104 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2025-03-04 14:38:17,413 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 49 [2025-03-04 14:38:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,413 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2025-03-04 14:38:17,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2025-03-04 14:38:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:38:17,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,414 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:17,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:38:17,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:17,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash -521224385, now seen corresponding path program 1 times [2025-03-04 14:38:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947405500] [2025-03-04 14:38:17,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:38:17,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:38:17,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947405500] [2025-03-04 14:38:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947405500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718378157] [2025-03-04 14:38:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:17,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,625 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,633 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2025-03-04 14:38:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:17,634 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:38:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,634 INFO L225 Difference]: With dead ends: 124 [2025-03-04 14:38:17,634 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 14:38:17,635 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-04 14:38:17,635 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 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-04 14:38:17,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 14:38:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 14:38:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 77 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-03-04 14:38:17,645 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2025-03-04 14:38:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,645 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-03-04 14:38:17,645 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-03-04 14:38:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:38:17,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,648 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:17,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:38:17,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:17,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 769947691, now seen corresponding path program 1 times [2025-03-04 14:38:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875588014] [2025-03-04 14:38:17,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:38:17,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:38:17,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875588014] [2025-03-04 14:38:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875588014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039022382] [2025-03-04 14:38:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:17,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,796 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,807 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-04 14:38:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-04 14:38:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,808 INFO L225 Difference]: With dead ends: 88 [2025-03-04 14:38:17,809 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 14:38:17,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:17,809 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:17,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 14:38:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 14:38:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 80 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2025-03-04 14:38:17,817 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 51 [2025-03-04 14:38:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,817 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2025-03-04 14:38:17,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2025-03-04 14:38:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:38:17,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,818 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-04 14:38:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:38:17,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1908673173, now seen corresponding path program 1 times [2025-03-04 14:38:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871093274] [2025-03-04 14:38:17,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:38:17,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:38:17,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871093274] [2025-03-04 14:38:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871093274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881054295] [2025-03-04 14:38:18,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:18,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:18,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:18,005 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-04 14:38:18,006 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-04 14:38:18,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:38:18,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:38:18,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:18,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:18,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881054295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:18,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:18,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214244331] [2025-03-04 14:38:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:18,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:18,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:18,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:18,292 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:18,310 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-03-04 14:38:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-04 14:38:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:18,311 INFO L225 Difference]: With dead ends: 83 [2025-03-04 14:38:18,311 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 14:38:18,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:18,312 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:18,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 14:38:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 14:38:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 79 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-03-04 14:38:18,322 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 54 [2025-03-04 14:38:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:18,322 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-03-04 14:38:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-03-04 14:38:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:38:18,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:18,325 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:18,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 14:38:18,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1852201982, now seen corresponding path program 1 times [2025-03-04 14:38:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984075437] [2025-03-04 14:38:18,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:18,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:18,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:18,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:38:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984075437] [2025-03-04 14:38:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984075437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150160414] [2025-03-04 14:38:18,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:18,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:18,657 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-04 14:38:18,658 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-04 14:38:18,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:18,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:18,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:38:18,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:38:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150160414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:18,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560177999] [2025-03-04 14:38:18,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:18,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:18,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:18,978 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,008 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2025-03-04 14:38:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:19,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:38:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,009 INFO L225 Difference]: With dead ends: 135 [2025-03-04 14:38:19,009 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 14:38:19,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:19,010 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:19,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 223 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 14:38:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 14:38:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-03-04 14:38:19,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 55 [2025-03-04 14:38:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-03-04 14:38:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-03-04 14:38:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:38:19,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,018 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 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-04 14:38:19,027 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-04 14:38:19,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:19,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 960668808, now seen corresponding path program 1 times [2025-03-04 14:38:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70888807] [2025-03-04 14:38:19,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:19,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:19,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70888807] [2025-03-04 14:38:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70888807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833119485] [2025-03-04 14:38:19,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:19,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:19,350 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-04 14:38:19,351 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-04 14:38:19,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:19,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:19,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:19,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833119485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:19,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:19,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048895636] [2025-03-04 14:38:19,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:19,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:19,673 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,699 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2025-03-04 14:38:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:38:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,700 INFO L225 Difference]: With dead ends: 110 [2025-03-04 14:38:19,700 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 14:38:19,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:19,700 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:19,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 14:38:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 14:38:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.118811881188119) internal successors, (113), 103 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2025-03-04 14:38:19,706 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 55 [2025-03-04 14:38:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,707 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2025-03-04 14:38:19,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2025-03-04 14:38:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 14:38:19,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,708 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:19,718 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-04 14:38:19,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:19,909 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1243777480, now seen corresponding path program 2 times [2025-03-04 14:38:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318480031] [2025-03-04 14:38:19,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-03-04 14:38:19,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 64 statements. [2025-03-04 14:38:19,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:19,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-04 14:38:19,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318480031] [2025-03-04 14:38:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318480031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:19,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:19,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651292421] [2025-03-04 14:38:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:19,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:19,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:19,997 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,005 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2025-03-04 14:38:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2025-03-04 14:38:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,006 INFO L225 Difference]: With dead ends: 125 [2025-03-04 14:38:20,006 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 14:38:20,007 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-04 14:38:20,007 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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-04 14:38:20,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 14:38:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 14:38:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-03-04 14:38:20,012 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 64 [2025-03-04 14:38:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,012 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-03-04 14:38:20,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-03-04 14:38:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 14:38:20,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,013 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:38:20,013 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:20,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash 399305609, now seen corresponding path program 1 times [2025-03-04 14:38:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287940743] [2025-03-04 14:38:20,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:20,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 14:38:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 14:38:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:20,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-04 14:38:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287940743] [2025-03-04 14:38:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287940743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934357224] [2025-03-04 14:38:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:20,213 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,250 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-04 14:38:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2025-03-04 14:38:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,251 INFO L225 Difference]: With dead ends: 132 [2025-03-04 14:38:20,251 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 14:38:20,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:20,252 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:20,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 160 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 14:38:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-04 14:38:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 106 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-03-04 14:38:20,256 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 64 [2025-03-04 14:38:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,256 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-03-04 14:38:20,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-03-04 14:38:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 14:38:20,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,256 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 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-04 14:38:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:38:20,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 306939910, now seen corresponding path program 1 times [2025-03-04 14:38:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485994462] [2025-03-04 14:38:20,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:20,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 14:38:20,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 14:38:20,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:20,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485994462] [2025-03-04 14:38:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485994462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201361702] [2025-03-04 14:38:20,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:20,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:20,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:20,437 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-04 14:38:20,439 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-04 14:38:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 14:38:20,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 14:38:20,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:20,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:20,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:20,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:38:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201361702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:20,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 14:38:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189225253] [2025-03-04 14:38:20,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:38:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:20,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:38:20,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:38:20,821 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,871 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2025-03-04 14:38:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:38:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2025-03-04 14:38:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,872 INFO L225 Difference]: With dead ends: 130 [2025-03-04 14:38:20,872 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 14:38:20,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:38:20,873 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:20,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 261 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 14:38:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 14:38:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.098360655737705) internal successors, (134), 124 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2025-03-04 14:38:20,879 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 65 [2025-03-04 14:38:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2025-03-04 14:38:20,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2025-03-04 14:38:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:38:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,879 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:20,891 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-04 14:38:21,080 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,SelfDestructingSolverStorable17 [2025-03-04 14:38:21,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1106879630, now seen corresponding path program 2 times [2025-03-04 14:38:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202988322] [2025-03-04 14:38:21,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:21,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:38:21,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:38:21,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:21,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:38:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202988322] [2025-03-04 14:38:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202988322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111836682] [2025-03-04 14:38:21,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:21,269 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-04 14:38:21,270 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-04 14:38:21,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:38:21,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:38:21,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:21,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:38:21,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:38:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111836682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:21,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:38:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067174593] [2025-03-04 14:38:21,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:21,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:38:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:21,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:38:21,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:21,734 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:21,996 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2025-03-04 14:38:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:38:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-04 14:38:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:21,997 INFO L225 Difference]: With dead ends: 233 [2025-03-04 14:38:21,997 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 14:38:21,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 14:38:21,998 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:21,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 307 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 14:38:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 14:38:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 158 states have (on average 1.0696202531645569) internal successors, (169), 159 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2025-03-04 14:38:22,003 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 73 [2025-03-04 14:38:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:22,004 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2025-03-04 14:38:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2025-03-04 14:38:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 14:38:22,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:22,004 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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-04 14:38:22,017 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-04 14:38:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:22,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:22,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2118306950, now seen corresponding path program 2 times [2025-03-04 14:38:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463114081] [2025-03-04 14:38:22,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:22,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 14:38:22,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 83 statements. [2025-03-04 14:38:22,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:22,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 14:38:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463114081] [2025-03-04 14:38:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463114081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:38:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102297149] [2025-03-04 14:38:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:22,420 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:22,471 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2025-03-04 14:38:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2025-03-04 14:38:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:22,472 INFO L225 Difference]: With dead ends: 213 [2025-03-04 14:38:22,472 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 14:38:22,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:22,473 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 14:38:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 14:38:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 158 states have (on average 1.0632911392405062) internal successors, (168), 159 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2025-03-04 14:38:22,481 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 83 [2025-03-04 14:38:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:22,482 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2025-03-04 14:38:22,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2025-03-04 14:38:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:38:22,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:22,483 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:22,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:38:22,483 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 557133126, now seen corresponding path program 1 times [2025-03-04 14:38:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300058306] [2025-03-04 14:38:22,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:22,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:38:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:38:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:38:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300058306] [2025-03-04 14:38:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300058306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768917863] [2025-03-04 14:38:22,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:22,701 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-04 14:38:22,703 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-04 14:38:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:38:23,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:38:23,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1757 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:23,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:38:23,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:38:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768917863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:23,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:38:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812351473] [2025-03-04 14:38:23,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:23,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:23,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:23,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:23,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:23,232 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:23,274 INFO L93 Difference]: Finished difference Result 265 states and 281 transitions. [2025-03-04 14:38:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-04 14:38:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:23,276 INFO L225 Difference]: With dead ends: 265 [2025-03-04 14:38:23,276 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 14:38:23,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:23,276 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:23,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 14:38:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-04 14:38:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 260 states have (on average 1.0615384615384615) internal successors, (276), 261 states have internal predecessors, (276), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 278 transitions. [2025-03-04 14:38:23,287 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 278 transitions. Word has length 110 [2025-03-04 14:38:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:23,287 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 278 transitions. [2025-03-04 14:38:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 278 transitions. [2025-03-04 14:38:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 14:38:23,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:23,288 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 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-04 14:38:23,298 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-04 14:38:23,489 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,SelfDestructingSolverStorable20 [2025-03-04 14:38:23,489 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1110937262, now seen corresponding path program 1 times [2025-03-04 14:38:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185001751] [2025-03-04 14:38:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:23,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 14:38:23,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 14:38:23,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185001751] [2025-03-04 14:38:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185001751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458792503] [2025-03-04 14:38:23,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:23,862 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-04 14:38:23,864 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-04 14:38:24,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 14:38:24,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 14:38:24,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:24,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:24,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1746 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 14:38:24,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:24,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458792503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:24,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 14:38:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779380998] [2025-03-04 14:38:24,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 14:38:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:24,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 14:38:24,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:38:24,511 INFO L87 Difference]: Start difference. First operand 264 states and 278 transitions. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:24,592 INFO L93 Difference]: Finished difference Result 303 states and 328 transitions. [2025-03-04 14:38:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:38:24,595 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-03-04 14:38:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:24,596 INFO L225 Difference]: With dead ends: 303 [2025-03-04 14:38:24,596 INFO L226 Difference]: Without dead ends: 300 [2025-03-04 14:38:24,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 14:38:24,598 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:24,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-04 14:38:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-04 14:38:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 296 states have (on average 1.054054054054054) internal successors, (312), 297 states have internal predecessors, (312), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2025-03-04 14:38:24,620 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 117 [2025-03-04 14:38:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:24,621 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2025-03-04 14:38:24,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2025-03-04 14:38:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 14:38:24,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:24,622 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 10, 10, 10, 10, 10, 1, 1, 1, 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-04 14:38:24,631 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-04 14:38:24,822 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,SelfDestructingSolverStorable21 [2025-03-04 14:38:24,823 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 279298990, now seen corresponding path program 2 times [2025-03-04 14:38:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071855840] [2025-03-04 14:38:24,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:24,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-03-04 14:38:24,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 14:38:24,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:24,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071855840] [2025-03-04 14:38:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071855840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431220728] [2025-03-04 14:38:25,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:25,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:25,723 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-04 14:38:25,725 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-04 14:38:26,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-03-04 14:38:26,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 14:38:26,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:26,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:26,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1974 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 14:38:26,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:26,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:38:26,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431220728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:26,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:26,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2025-03-04 14:38:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261390066] [2025-03-04 14:38:26,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 14:38:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:26,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 14:38:26,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 14:38:26,773 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:26,928 INFO L93 Difference]: Finished difference Result 363 states and 396 transitions. [2025-03-04 14:38:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 14:38:26,929 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2025-03-04 14:38:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:26,934 INFO L225 Difference]: With dead ends: 363 [2025-03-04 14:38:26,934 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 14:38:26,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 282 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 14:38:26,935 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:26,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 14:38:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-04 14:38:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 356 states have (on average 1.0449438202247192) internal successors, (372), 357 states have internal predecessors, (372), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 374 transitions. [2025-03-04 14:38:26,946 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 374 transitions. Word has length 153 [2025-03-04 14:38:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 374 transitions. [2025-03-04 14:38:26,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 374 transitions. [2025-03-04 14:38:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-04 14:38:26,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:26,949 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:26,960 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-04 14:38:27,149 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,SelfDestructingSolverStorable22 [2025-03-04 14:38:27,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1395554766, now seen corresponding path program 2 times [2025-03-04 14:38:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235493011] [2025-03-04 14:38:27,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:27,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-03-04 14:38:27,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 212 statements. [2025-03-04 14:38:27,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:27,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4110 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 2818 trivial. 0 not checked. [2025-03-04 14:38:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235493011] [2025-03-04 14:38:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235493011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688389937] [2025-03-04 14:38:27,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:27,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:27,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:27,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:38:27,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-03-04 14:38:27,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 212 statements. [2025-03-04 14:38:27,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:27,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:27,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:27,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4110 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 2818 trivial. 0 not checked. [2025-03-04 14:38:27,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4110 backedges. 0 proven. 1292 refuted. 0 times theorem prover too weak. 2818 trivial. 0 not checked. [2025-03-04 14:38:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688389937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:27,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 14:38:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872759187] [2025-03-04 14:38:27,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:27,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:27,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:27,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:27,975 INFO L87 Difference]: Start difference. First operand 360 states and 374 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:28,011 INFO L93 Difference]: Finished difference Result 360 states and 374 transitions. [2025-03-04 14:38:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:28,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 212 [2025-03-04 14:38:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:28,013 INFO L225 Difference]: With dead ends: 360 [2025-03-04 14:38:28,013 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 14:38:28,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:28,013 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:28,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 14:38:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 224. [2025-03-04 14:38:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.0361990950226245) internal successors, (229), 221 states have internal predecessors, (229), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 231 transitions. [2025-03-04 14:38:28,022 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 231 transitions. Word has length 212 [2025-03-04 14:38:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:28,023 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 231 transitions. [2025-03-04 14:38:28,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 231 transitions. [2025-03-04 14:38:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 14:38:28,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:28,024 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 10, 10, 10, 10, 1, 1, 1, 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-04 14:38:28,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:28,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 14:38:28,225 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1811990190, now seen corresponding path program 3 times [2025-03-04 14:38:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518539871] [2025-03-04 14:38:28,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:38:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:28,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 213 statements into 43 equivalence classes. [2025-03-04 14:38:31,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 14:38:31,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2025-03-04 14:38:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:38:31,645 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:38:31,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 14:38:31,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 14:38:31,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:31,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:38:32,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:38:32,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:38:32,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (24 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-04 14:38:32,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-04 14:38:32,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-04 14:38:32,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-04 14:38:32,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-04 14:38:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 14:38:32,055 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:32,158 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:38:32,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:38:32 BoogieIcfgContainer [2025-03-04 14:38:32,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:38:32,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:38:32,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:38:32,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:38:32,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:13" (3/4) ... [2025-03-04 14:38:32,165 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:38:32,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:38:32,167 INFO L158 Benchmark]: Toolchain (without parser) took 20308.61ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 110.3MB in the beginning and 628.9MB in the end (delta: -518.6MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.77ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 66.0MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.85ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: Boogie Preprocessor took 90.42ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 53.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: IcfgBuilder took 649.06ms. Allocated memory is still 142.6MB. Free memory was 53.3MB in the beginning and 61.5MB in the end (delta: -8.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: TraceAbstraction took 18885.67ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 60.8MB in the beginning and 629.0MB in the end (delta: -568.2MB). Peak memory consumption was 291.2MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,169 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 721.4MB. Free memory was 629.0MB in the beginning and 628.9MB in the end (delta: 92.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:38:32,170 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.77ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 66.0MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.85ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.42ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 53.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 649.06ms. Allocated memory is still 142.6MB. Free memory was 53.3MB in the beginning and 61.5MB in the end (delta: -8.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18885.67ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 60.8MB in the beginning and 629.0MB in the end (delta: -568.2MB). Peak memory consumption was 291.2MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 721.4MB. Free memory was 629.0MB in the beginning and 628.9MB in the end (delta: 92.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1162]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1162. Possible FailurePath: [L1136] static const char *applet_name; [L1137] static signed int bb_errno_location; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1304] char *a = malloc(11); [L1305] a[10] = 0 [L1306] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=1] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=2] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=3] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=4] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=5] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=6] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=7] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=8] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=9] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=10] [L1306] COND FALSE !(i<10) [L1308] applet_name = a [L1309] bb_errno_location = __VERIFIER_nondet_int() [L1310] optind = 1 [L1311] int argc = __VERIFIER_nondet_int(); [L1312] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1312] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1313] EXPR argc+1 [L1313] char **argv=malloc((argc+1)*sizeof(char*)); [L1314] EXPR argc+1 [L1314] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1315] argv[argc]=0 [L1316] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0, mem_track={-13:0}, optind=1] [L1316] COND TRUE i 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2025-03-04 14:38:34,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:34,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:34,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:34,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:34,446 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:34,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 14:38:35,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b42619c/9cd27dd4053e46d58237a979aa09e2b3/FLAG887577ae4 [2025-03-04 14:38:35,907 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:35,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-03-04 14:38:35,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b42619c/9cd27dd4053e46d58237a979aa09e2b3/FLAG887577ae4 [2025-03-04 14:38:35,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b42619c/9cd27dd4053e46d58237a979aa09e2b3 [2025-03-04 14:38:35,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:35,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:35,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:35,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:35,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:35,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5210cd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35, skipping insertion in model container [2025-03-04 14:38:35,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:36,303 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:38:36,314 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:38:36,315 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:38:36,319 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:38:36,330 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:38:36,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:36,366 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:36,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:36,544 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:36,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36 WrapperNode [2025-03-04 14:38:36,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:36,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:36,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:36,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:36,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,600 INFO L138 Inliner]: procedures = 351, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-03-04 14:38:36,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:36,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:36,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:36,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:36,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,637 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 6, 11, 3, 3, 2, 3, 4, 4, 4, 4, 3, 44, 2, 355]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 0, 0, 3, 3, 0, 3, 3, 3, 3, 3, 3, 42, 0, 355]. The 9 writes are split as follows [0, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 1, 0]. [2025-03-04 14:38:36,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:36,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:36,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:36,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:36,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (1/1) ... [2025-03-04 14:38:36,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:36,716 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-04 14:38:36,721 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-04 14:38:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 14:38:36,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:36,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:38:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 14:38:36,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-04 14:38:36,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-04 14:38:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:38:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:36,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:36,973 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:36,975 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:37,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-03-04 14:38:37,743 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:37,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:37,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:37,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:37,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:37 BoogieIcfgContainer [2025-03-04 14:38:37,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:37,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:37,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:37,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:37,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:35" (1/3) ... [2025-03-04 14:38:37,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2d1181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:37, skipping insertion in model container [2025-03-04 14:38:37,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:36" (2/3) ... [2025-03-04 14:38:37,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2d1181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:37, skipping insertion in model container [2025-03-04 14:38:37,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:37" (3/3) ... [2025-03-04 14:38:37,764 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-03-04 14:38:37,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:37,775 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 90 locations, 1 initial locations, 6 loop locations, and 25 error locations. [2025-03-04 14:38:37,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:37,824 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;@31c98ef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:37,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 14:38:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 87 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:37,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:37,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:37,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 4401087, now seen corresponding path program 1 times [2025-03-04 14:38:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:37,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921891610] [2025-03-04 14:38:37,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:37,849 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-04 14:38:37,851 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-04 14:38:38,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:38,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:38,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:38,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:38,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:38:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:38,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:38,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921891610] [2025-03-04 14:38:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921891610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:38,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:38:38,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680509830] [2025-03-04 14:38:38,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:38:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:38,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:38:38,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:38:38,569 INFO L87 Difference]: Start difference. First operand has 90 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 87 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-04 14:38:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:38,586 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2025-03-04 14:38:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:38:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:38:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:38,593 INFO L225 Difference]: With dead ends: 145 [2025-03-04 14:38:38,594 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 14:38:38,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:38:38,599 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:38,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 14:38:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 14:38:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 61 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2025-03-04 14:38:38,627 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 4 [2025-03-04 14:38:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:38,627 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2025-03-04 14:38:38,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-04 14:38:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2025-03-04 14:38:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:38:38,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:38,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:38:38,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:38,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:38,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:38,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash 136433774, now seen corresponding path program 1 times [2025-03-04 14:38:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:38,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664231029] [2025-03-04 14:38:38,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:38,833 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-04 14:38:38,835 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-04 14:38:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:38:39,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:38:39,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:39,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:39,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:39,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:39,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:39,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:39,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664231029] [2025-03-04 14:38:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664231029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934602182] [2025-03-04 14:38:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:39,498 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:38:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:39,524 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2025-03-04 14:38:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 14:38:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:39,527 INFO L225 Difference]: With dead ends: 126 [2025-03-04 14:38:39,528 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 14:38:39,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:39,529 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:39,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 14:38:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 14:38:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-04 14:38:39,534 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 5 [2025-03-04 14:38:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-04 14:38:39,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:38:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-04 14:38:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:39,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:39,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:39,561 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-04 14:38:39,735 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 [2025-03-04 14:38:39,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1459579585, now seen corresponding path program 1 times [2025-03-04 14:38:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:39,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203142659] [2025-03-04 14:38:39,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:39,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:39,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:39,739 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-04 14:38:39,740 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-04 14:38:39,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:40,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:40,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:40,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:40,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:40,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:40,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:38:40,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203142659] [2025-03-04 14:38:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203142659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:40,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394400460] [2025-03-04 14:38:40,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:40,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:40,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:40,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:40,536 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-04 14:38:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:40,604 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2025-03-04 14:38:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:40,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:38:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:40,606 INFO L225 Difference]: With dead ends: 129 [2025-03-04 14:38:40,606 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 14:38:40,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:40,606 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:40,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 14:38:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-03-04 14:38:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 64 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-04 14:38:40,617 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 8 [2025-03-04 14:38:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:40,617 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-04 14:38:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-04 14:38:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-04 14:38:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:38:40,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:40,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:40,651 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-04 14:38:40,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:40,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 996983672, now seen corresponding path program 1 times [2025-03-04 14:38:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873322525] [2025-03-04 14:38:40,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:40,822 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-04 14:38:40,824 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-04 14:38:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:38:41,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:38:41,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:41,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:41,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:41,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:41,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:41,477 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:41,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873322525] [2025-03-04 14:38:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873322525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863951050] [2025-03-04 14:38:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:41,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:41,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:41,479 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:41,666 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-03-04 14:38:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 14:38:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:41,671 INFO L225 Difference]: With dead ends: 67 [2025-03-04 14:38:41,671 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 14:38:41,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:41,672 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:38:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 14:38:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 14:38:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 62 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-04 14:38:41,681 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 16 [2025-03-04 14:38:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-04 14:38:41,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-04 14:38:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:41,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:41,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:41,707 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-04 14:38:41,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:41,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1626883058, now seen corresponding path program 1 times [2025-03-04 14:38:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803239870] [2025-03-04 14:38:41,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:41,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:41,887 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-04 14:38:41,888 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-04 14:38:41,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:38:42,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:38:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:42,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:42,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:42,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:42,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803239870] [2025-03-04 14:38:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803239870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055487001] [2025-03-04 14:38:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:42,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:42,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:42,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:42,540 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:42,655 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2025-03-04 14:38:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:38:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:42,658 INFO L225 Difference]: With dead ends: 73 [2025-03-04 14:38:42,658 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 14:38:42,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-04 14:38:42,659 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:42,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 14:38:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-04 14:38:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.34375) internal successors, (86), 68 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-03-04 14:38:42,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 22 [2025-03-04 14:38:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:42,663 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-03-04 14:38:42,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-03-04 14:38:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:42,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:42,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:42,689 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-04 14:38:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:42,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:42,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1626878093, now seen corresponding path program 1 times [2025-03-04 14:38:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662199149] [2025-03-04 14:38:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:42,867 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-04 14:38:42,869 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-04 14:38:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:38:43,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:38:43,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:43,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:43,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:43,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:43,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:43,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662199149] [2025-03-04 14:38:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662199149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685192362] [2025-03-04 14:38:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:43,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:43,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:43,549 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:43,578 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2025-03-04 14:38:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:38:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:43,580 INFO L225 Difference]: With dead ends: 126 [2025-03-04 14:38:43,580 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 14:38:43,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-04 14:38:43,581 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:43,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 14:38:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 14:38:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 74 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2025-03-04 14:38:43,591 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 22 [2025-03-04 14:38:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:43,591 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2025-03-04 14:38:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2025-03-04 14:38:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:38:43,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:43,594 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] [2025-03-04 14:38:43,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:43,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:43,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:43,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1914236020, now seen corresponding path program 1 times [2025-03-04 14:38:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:43,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999772443] [2025-03-04 14:38:43,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:43,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:43,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:43,798 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-04 14:38:43,798 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-04 14:38:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:38:44,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:38:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:44,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:44,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:44,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:44,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999772443] [2025-03-04 14:38:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999772443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:44,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711259154] [2025-03-04 14:38:44,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:44,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:44,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:44,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:44,528 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:44,632 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2025-03-04 14:38:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 14:38:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:44,634 INFO L225 Difference]: With dead ends: 136 [2025-03-04 14:38:44,634 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 14:38:44,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:44,635 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:44,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 14:38:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2025-03-04 14:38:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-03-04 14:38:44,640 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 25 [2025-03-04 14:38:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:44,640 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-03-04 14:38:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-03-04 14:38:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:38:44,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:44,641 INFO L218 NwaCegarLoop]: trace histogram [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-04 14:38:44,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:38:44,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:44,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:44,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:44,842 INFO L85 PathProgramCache]: Analyzing trace with hash 700147272, now seen corresponding path program 1 times [2025-03-04 14:38:44,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:44,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595075282] [2025-03-04 14:38:44,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:44,844 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-04 14:38:44,846 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-04 14:38:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:38:45,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:38:45,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:45,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:45,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:45,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:45,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595075282] [2025-03-04 14:38:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595075282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:45,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658174248] [2025-03-04 14:38:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:45,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:45,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:45,453 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:45,466 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2025-03-04 14:38:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:45,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 14:38:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:45,467 INFO L225 Difference]: With dead ends: 88 [2025-03-04 14:38:45,467 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 14:38:45,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-04 14:38:45,468 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 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-04 14:38:45,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 14:38:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 14:38:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.273972602739726) internal successors, (93), 76 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2025-03-04 14:38:45,471 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 28 [2025-03-04 14:38:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2025-03-04 14:38:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2025-03-04 14:38:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:38:45,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:45,472 INFO L218 NwaCegarLoop]: trace histogram [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-04 14:38:45,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:38:45,672 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 [2025-03-04 14:38:45,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1587650953, now seen corresponding path program 1 times [2025-03-04 14:38:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58949954] [2025-03-04 14:38:45,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:45,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:45,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:45,675 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-04 14:38:45,676 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-04 14:38:45,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:38:46,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:38:46,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:46,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:38:46,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:46,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:46,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58949954] [2025-03-04 14:38:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58949954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:46,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:46,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260581899] [2025-03-04 14:38:46,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:46,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:46,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:46,352 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:46,548 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2025-03-04 14:38:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 14:38:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:46,550 INFO L225 Difference]: With dead ends: 95 [2025-03-04 14:38:46,550 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 14:38:46,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:46,550 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:46,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:38:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 14:38:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-03-04 14:38:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 78 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2025-03-04 14:38:46,555 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 28 [2025-03-04 14:38:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:46,555 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2025-03-04 14:38:46,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2025-03-04 14:38:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 14:38:46,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:46,558 INFO L218 NwaCegarLoop]: trace histogram [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-04 14:38:46,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:38:46,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:46,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:46,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash -626194298, now seen corresponding path program 1 times [2025-03-04 14:38:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:46,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868139738] [2025-03-04 14:38:46,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:46,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:46,761 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-04 14:38:46,762 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-04 14:38:46,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 14:38:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 14:38:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:47,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:47,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:47,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:47,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868139738] [2025-03-04 14:38:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868139738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309856096] [2025-03-04 14:38:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:47,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:47,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:47,395 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:47,420 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-03-04 14:38:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 14:38:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:47,421 INFO L225 Difference]: With dead ends: 88 [2025-03-04 14:38:47,421 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 14:38:47,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-04 14:38:47,422 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:47,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 14:38:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 14:38:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 81 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2025-03-04 14:38:47,426 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 29 [2025-03-04 14:38:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:47,426 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2025-03-04 14:38:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2025-03-04 14:38:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:47,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:47,427 INFO L218 NwaCegarLoop]: trace histogram [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-04 14:38:47,453 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-04 14:38:47,627 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 [2025-03-04 14:38:47,627 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:47,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -104899281, now seen corresponding path program 1 times [2025-03-04 14:38:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059224365] [2025-03-04 14:38:47,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:47,630 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-04 14:38:47,630 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-04 14:38:47,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:48,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:48,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:48,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:48,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:48,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:38:48,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:48,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059224365] [2025-03-04 14:38:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059224365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:48,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:48,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127387346] [2025-03-04 14:38:48,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:48,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:48,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:48,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:48,205 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:48,216 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-03-04 14:38:48,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:38:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:48,217 INFO L225 Difference]: With dead ends: 104 [2025-03-04 14:38:48,217 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 14:38:48,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-04 14:38:48,217 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 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-04 14:38:48,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 14:38:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 14:38:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-04 14:38:48,220 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2025-03-04 14:38:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:48,220 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-04 14:38:48,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-04 14:38:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 14:38:48,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:48,225 INFO L218 NwaCegarLoop]: trace histogram [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-04 14:38:48,247 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-04 14:38:48,425 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 [2025-03-04 14:38:48,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1763461878, now seen corresponding path program 1 times [2025-03-04 14:38:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:48,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177725991] [2025-03-04 14:38:48,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:48,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:48,428 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-04 14:38:48,429 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-04 14:38:48,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 14:38:48,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 14:38:48,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:48,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:49,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:38:49,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 14:38:49,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:49,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177725991] [2025-03-04 14:38:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177725991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:49,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:38:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044283479] [2025-03-04 14:38:49,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:49,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:49,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:49,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:49,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:49,070 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:49,344 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-03-04 14:38:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 14:38:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:49,345 INFO L225 Difference]: With dead ends: 93 [2025-03-04 14:38:49,345 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 14:38:49,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:49,345 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:49,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:38:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 14:38:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 14:38:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-03-04 14:38:49,348 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 32 [2025-03-04 14:38:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:49,348 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 14:38:49,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-03-04 14:38:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:38:49,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:49,349 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:49,374 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-04 14:38:49,549 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 [2025-03-04 14:38:49,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash -238348602, now seen corresponding path program 1 times [2025-03-04 14:38:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023391014] [2025-03-04 14:38:49,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:49,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:49,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:49,553 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:49,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:38:49,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:38:50,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:38:50,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:50,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:50,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:38:50,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:38:50,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023391014] [2025-03-04 14:38:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023391014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:50,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962220311] [2025-03-04 14:38:50,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:50,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:50,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:50,275 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:50,649 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2025-03-04 14:38:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-03-04 14:38:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:50,651 INFO L225 Difference]: With dead ends: 87 [2025-03-04 14:38:50,651 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 14:38:50,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:50,651 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:50,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:38:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 14:38:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2025-03-04 14:38:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-04 14:38:50,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 38 [2025-03-04 14:38:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-04 14:38:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-04 14:38:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 14:38:50,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:50,659 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:50,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 14:38:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:50,860 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1248052834, now seen corresponding path program 1 times [2025-03-04 14:38:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007355665] [2025-03-04 14:38:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:50,863 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:50,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 14:38:50,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 14:38:51,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 14:38:51,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:51,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:51,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:51,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:38:51,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 14:38:51,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:51,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007355665] [2025-03-04 14:38:51,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007355665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:51,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:51,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-04 14:38:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176705991] [2025-03-04 14:38:51,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:51,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:51,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:51,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:51,523 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:51,573 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-04 14:38:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-04 14:38:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:51,574 INFO L225 Difference]: With dead ends: 66 [2025-03-04 14:38:51,574 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 14:38:51,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:51,575 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:51,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 167 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:38:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 14:38:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 14:38:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-03-04 14:38:51,578 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2025-03-04 14:38:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:51,578 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-03-04 14:38:51,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-03-04 14:38:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:38:51,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:51,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2025-03-04 14:38:51,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 14:38:51,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:51,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:51,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1816190254, now seen corresponding path program 2 times [2025-03-04 14:38:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240041681] [2025-03-04 14:38:51,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:51,782 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:51,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 14:38:51,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 14:38:52,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:38:52,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:52,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:52,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:52,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 14:38:52,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 14:38:52,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240041681] [2025-03-04 14:38:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240041681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:52,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:38:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124702327] [2025-03-04 14:38:52,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:38:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:53,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:38:53,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:53,000 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:38:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:53,073 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2025-03-04 14:38:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:38:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-03-04 14:38:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:53,075 INFO L225 Difference]: With dead ends: 127 [2025-03-04 14:38:53,075 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 14:38:53,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:38:53,076 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:53,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 170 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 14:38:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 14:38:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:38:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-03-04 14:38:53,082 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 51 [2025-03-04 14:38:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:53,082 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-03-04 14:38:53,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:38:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-03-04 14:38:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 14:38:53,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:53,083 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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, 1] [2025-03-04 14:38:53,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 14:38:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:53,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:38:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1188301678, now seen corresponding path program 3 times [2025-03-04 14:38:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874125403] [2025-03-04 14:38:53,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:38:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:53,286 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:38:53,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 14:38:53,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 7 equivalence classes. [2025-03-04 14:39:10,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 63 statements. [2025-03-04 14:39:10,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 14:39:10,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:10,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:39:10,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 14:39:10,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 14:39:10,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:39:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874125403] [2025-03-04 14:39:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874125403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:10,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:39:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:39:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786760598] [2025-03-04 14:39:10,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:39:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:39:10,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:39:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:39:10,985 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:11,175 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2025-03-04 14:39:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:39:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-04 14:39:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:11,176 INFO L225 Difference]: With dead ends: 129 [2025-03-04 14:39:11,176 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 14:39:11,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:39:11,177 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:11,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 208 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 14:39:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 14:39:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-03-04 14:39:11,181 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2025-03-04 14:39:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:11,181 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-03-04 14:39:11,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-03-04 14:39:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 14:39:11,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:11,182 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 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-04 14:39:11,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 14:39:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:11,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:39:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -44011346, now seen corresponding path program 4 times [2025-03-04 14:39:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:39:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65861496] [2025-03-04 14:39:11,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 14:39:11,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:11,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:11,388 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 14:39:11,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-04 14:39:30,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 14:39:30,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 14:39:30,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:30,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:39:30,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 14:39:30,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 14:39:30,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:39:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65861496] [2025-03-04 14:39:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65861496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:30,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:39:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 14:39:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664643885] [2025-03-04 14:39:30,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 14:39:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:39:30,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 14:39:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:39:30,393 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:30,588 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2025-03-04 14:39:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:39:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-03-04 14:39:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:30,589 INFO L225 Difference]: With dead ends: 107 [2025-03-04 14:39:30,589 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 14:39:30,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 14:39:30,590 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:30,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 372 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 14:39:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 14:39:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.0792079207920793) internal successors, (109), 101 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-03-04 14:39:30,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 75 [2025-03-04 14:39:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:30,595 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-03-04 14:39:30,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-03-04 14:39:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 14:39:30,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:30,595 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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-04 14:39:30,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 14:39:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:30,796 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2025-03-04 14:39:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1396843730, now seen corresponding path program 5 times [2025-03-04 14:39:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:39:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679852977] [2025-03-04 14:39:30,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 14:39:30,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:30,799 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:30,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 14:39:30,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 93 statements into 11 equivalence classes.