./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/uname-2.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 ce381cf603602873aa7825ca610797c82dd7f7e7d56006b032fdfc5a2bfa2e82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:56:10,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:56:10,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:56:10,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:56:10,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:56:10,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:56:10,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:56:10,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:56:10,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:56:10,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:56:10,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:56:10,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:56:10,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:56:10,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:56:10,723 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:56:10,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:56:10,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:10,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:56:10,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:56:10,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:56:10,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:56:10,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:56:10,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:56:10,725 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 -> ce381cf603602873aa7825ca610797c82dd7f7e7d56006b032fdfc5a2bfa2e82 [2025-03-09 05:56:10,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:56:10,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:56:10,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:56:10,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:56:10,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:56:10,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uname-2.i [2025-03-09 05:56:12,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ef2fd70/fda7ca971a564b14b64b75ff1b5ee657/FLAGdd109a8f8 [2025-03-09 05:56:12,452 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:56:12,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uname-2.i [2025-03-09 05:56:12,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ef2fd70/fda7ca971a564b14b64b75ff1b5ee657/FLAGdd109a8f8 [2025-03-09 05:56:12,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ef2fd70/fda7ca971a564b14b64b75ff1b5ee657 [2025-03-09 05:56:12,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:56:12,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:56:12,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:12,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:56:12,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:56:12,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:12" (1/1) ... [2025-03-09 05:56:12,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373f1443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:12, skipping insertion in model container [2025-03-09 05:56:12,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:12" (1/1) ... [2025-03-09 05:56:12,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:56:13,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:13,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:56:13,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:13,606 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:56:13,613 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:56:13,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13 WrapperNode [2025-03-09 05:56:13,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:13,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:13,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:56:13,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:56:13,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,750 INFO L138 Inliner]: procedures = 570, calls = 888, calls flagged for inlining = 24, calls inlined = 22, statements flattened = 2089 [2025-03-09 05:56:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:13,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:56:13,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:56:13,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:56:13,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,793 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:56:13,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:56:13,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:56:13,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:56:13,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:56:13,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (1/1) ... [2025-03-09 05:56:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:13,920 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-09 05:56:13,922 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-09 05:56:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:56:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:56:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:56:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:56:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 05:56:13,941 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 05:56:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:56:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:56:13,941 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:56:13,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:56:14,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:56:14,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:56:20,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc getopt_long_#t~ret265#1; [2025-03-09 05:56:20,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2829: call ULTIMATE.dealloc(__main_~#uname_info~0#1.base, __main_~#uname_info~0#1.offset);havoc __main_~#uname_info~0#1.base, __main_~#uname_info~0#1.offset; [2025-03-09 05:56:20,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-09 05:56:20,414 INFO L? ?]: Removed 562 outVars from TransFormulas that were not future-live. [2025-03-09 05:56:20,415 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:56:20,450 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:56:20,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:56:20,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:20 BoogieIcfgContainer [2025-03-09 05:56:20,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:56:20,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:56:20,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:56:20,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:56:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:56:12" (1/3) ... [2025-03-09 05:56:20,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b42f542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:20, skipping insertion in model container [2025-03-09 05:56:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:13" (2/3) ... [2025-03-09 05:56:20,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b42f542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:20, skipping insertion in model container [2025-03-09 05:56:20,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:20" (3/3) ... [2025-03-09 05:56:20,462 INFO L128 eAbstractionObserver]: Analyzing ICFG uname-2.i [2025-03-09 05:56:20,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:56:20,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uname-2.i that has 8 procedures, 510 locations, 1 initial locations, 37 loop locations, and 73 error locations. [2025-03-09 05:56:20,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:56:20,528 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;@729790df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:56:20,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2025-03-09 05:56:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 407 states have (on average 1.683046683046683) internal successors, (685), 483 states have internal predecessors, (685), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 05:56:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:56:20,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:20,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:56:20,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:56:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 26503999, now seen corresponding path program 1 times [2025-03-09 05:56:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166426331] [2025-03-09 05:56:20,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:56:27,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:56:27,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:27,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:27,793 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-09 05:56:27,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:27,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166426331] [2025-03-09 05:56:27,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166426331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:27,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:27,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866985707] [2025-03-09 05:56:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:27,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:27,812 INFO L87 Difference]: Start difference. First operand has 510 states, 407 states have (on average 1.683046683046683) internal successors, (685), 483 states have internal predecessors, (685), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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-09 05:56:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:28,407 INFO L93 Difference]: Finished difference Result 925 states and 1350 transitions. [2025-03-09 05:56:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:28,409 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-09 05:56:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:28,418 INFO L225 Difference]: With dead ends: 925 [2025-03-09 05:56:28,418 INFO L226 Difference]: Without dead ends: 417 [2025-03-09 05:56:28,424 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-09 05:56:28,428 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:28,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:56:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-09 05:56:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-03-09 05:56:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 342 states have (on average 1.605263157894737) internal successors, (549), 398 states have internal predecessors, (549), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:56:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 580 transitions. [2025-03-09 05:56:28,491 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 580 transitions. Word has length 4 [2025-03-09 05:56:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:28,492 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 580 transitions. [2025-03-09 05:56:28,492 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-09 05:56:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 580 transitions. [2025-03-09 05:56:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:56:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:28,493 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:56:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:56:28,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:56:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -692558694, now seen corresponding path program 1 times [2025-03-09 05:56:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385062851] [2025-03-09 05:56:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:34,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:34,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:34,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:34,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:35,306 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-09 05:56:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385062851] [2025-03-09 05:56:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385062851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:35,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925594004] [2025-03-09 05:56:35,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:35,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:35,310 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-09 05:56:35,311 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-09 05:56:41,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:41,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:41,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:41,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:41,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:41,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:42,073 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-09 05:56:42,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925594004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:56:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414803379] [2025-03-09 05:56:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:56:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:56:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:42,075 INFO L87 Difference]: Start difference. First operand 417 states and 580 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-09 05:56:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:42,516 INFO L93 Difference]: Finished difference Result 417 states and 580 transitions. [2025-03-09 05:56:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:56:42,517 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-09 05:56:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:42,518 INFO L225 Difference]: With dead ends: 417 [2025-03-09 05:56:42,519 INFO L226 Difference]: Without dead ends: 416 [2025-03-09 05:56:42,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:42,519 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:42,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1099 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:56:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-09 05:56:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-09 05:56:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 342 states have (on average 1.6023391812865497) internal successors, (548), 397 states have internal predecessors, (548), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:56:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 579 transitions. [2025-03-09 05:56:42,537 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 579 transitions. Word has length 7 [2025-03-09 05:56:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:42,538 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 579 transitions. [2025-03-09 05:56:42,538 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-09 05:56:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 579 transitions. [2025-03-09 05:56:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:56:42,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:42,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:56:42,550 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-09 05:56:42,743 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-09 05:56:42,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:56:42,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash 5517761, now seen corresponding path program 1 times [2025-03-09 05:56:42,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:42,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209021897] [2025-03-09 05:56:42,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:56:48,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:56:48,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:48,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:49,213 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-09 05:56:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:49,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209021897] [2025-03-09 05:56:49,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209021897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:49,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100869473] [2025-03-09 05:56:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:49,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:49,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:49,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:49,214 INFO L87 Difference]: Start difference. First operand 416 states and 579 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-09 05:56:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:49,603 INFO L93 Difference]: Finished difference Result 416 states and 579 transitions. [2025-03-09 05:56:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:49,604 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-09 05:56:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:49,606 INFO L225 Difference]: With dead ends: 416 [2025-03-09 05:56:49,606 INFO L226 Difference]: Without dead ends: 415 [2025-03-09 05:56:49,606 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-09 05:56:49,607 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:49,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:56:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-09 05:56:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2025-03-09 05:56:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 340 states have (on average 1.6029411764705883) internal successors, (545), 394 states have internal predecessors, (545), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:56:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 576 transitions. [2025-03-09 05:56:49,618 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 576 transitions. Word has length 8 [2025-03-09 05:56:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:49,618 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 576 transitions. [2025-03-09 05:56:49,618 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-09 05:56:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 576 transitions. [2025-03-09 05:56:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:56:49,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:49,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:49,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:56:49,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:56:49,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1878707927, now seen corresponding path program 1 times [2025-03-09 05:56:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789265094] [2025-03-09 05:56:49,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:55,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:56:55,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:56:55,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:55,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:56,017 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-09 05:56:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789265094] [2025-03-09 05:56:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789265094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615654246] [2025-03-09 05:56:56,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:56,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:56,020 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-09 05:56:56,022 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-09 05:57:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:57:02,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:57:02,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:02,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:02,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:57:02,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:02,723 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-09 05:57:02,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:57:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615654246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:02,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:57:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:57:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627653235] [2025-03-09 05:57:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:02,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:02,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:02,725 INFO L87 Difference]: Start difference. First operand 413 states and 576 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-09 05:57:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:03,039 INFO L93 Difference]: Finished difference Result 413 states and 576 transitions. [2025-03-09 05:57:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:03,040 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-09 05:57:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:03,042 INFO L225 Difference]: With dead ends: 413 [2025-03-09 05:57:03,042 INFO L226 Difference]: Without dead ends: 411 [2025-03-09 05:57:03,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:03,043 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 507 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:03,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 593 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:57:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-09 05:57:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-09 05:57:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 340 states have (on average 1.5970588235294119) internal successors, (543), 392 states have internal predecessors, (543), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 574 transitions. [2025-03-09 05:57:03,060 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 574 transitions. Word has length 12 [2025-03-09 05:57:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 574 transitions. [2025-03-09 05:57:03,062 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-09 05:57:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 574 transitions. [2025-03-09 05:57:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:57:03,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:03,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:03,076 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-09 05:57:03,263 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-09 05:57:03,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:03,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1889597196, now seen corresponding path program 1 times [2025-03-09 05:57:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961510174] [2025-03-09 05:57:03,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:09,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:09,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:09,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:09,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:09,508 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-09 05:57:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961510174] [2025-03-09 05:57:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961510174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:57:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626556607] [2025-03-09 05:57:09,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:57:09,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:57:09,511 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-09 05:57:09,512 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-09 05:57:15,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:57:16,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:57:16,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:16,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:16,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:57:16,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:57:16,299 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-09 05:57:16,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:57:16,544 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-09 05:57:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626556607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:57:16,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:57:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:57:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673512152] [2025-03-09 05:57:16,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:57:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:57:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:16,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:57:16,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:16,546 INFO L87 Difference]: Start difference. First operand 411 states and 574 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-09 05:57:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:17,222 INFO L93 Difference]: Finished difference Result 825 states and 1153 transitions. [2025-03-09 05:57:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:57:17,223 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-09 05:57:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:17,224 INFO L225 Difference]: With dead ends: 825 [2025-03-09 05:57:17,225 INFO L226 Difference]: Without dead ends: 420 [2025-03-09 05:57:17,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:57:17,226 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 4 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:17,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1643 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 05:57:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-09 05:57:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-09 05:57:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 349 states have (on average 1.5816618911174785) internal successors, (552), 401 states have internal predecessors, (552), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 583 transitions. [2025-03-09 05:57:17,242 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 583 transitions. Word has length 13 [2025-03-09 05:57:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 583 transitions. [2025-03-09 05:57:17,242 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-09 05:57:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 583 transitions. [2025-03-09 05:57:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:57:17,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:17,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:17,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:57:17,443 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-09 05:57:17,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1521410609, now seen corresponding path program 2 times [2025-03-09 05:57:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768722169] [2025-03-09 05:57:17,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:57:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:23,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:57:23,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:57:23,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:57:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:24,074 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-09 05:57:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768722169] [2025-03-09 05:57:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768722169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:24,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:57:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354655870] [2025-03-09 05:57:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:24,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:57:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:24,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:57:24,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:24,076 INFO L87 Difference]: Start difference. First operand 420 states and 583 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-09 05:57:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:24,850 INFO L93 Difference]: Finished difference Result 420 states and 583 transitions. [2025-03-09 05:57:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:57:24,851 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-09 05:57:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:24,852 INFO L225 Difference]: With dead ends: 420 [2025-03-09 05:57:24,852 INFO L226 Difference]: Without dead ends: 418 [2025-03-09 05:57:24,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:57:24,853 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 506 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:24,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1664 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 05:57:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-09 05:57:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-09 05:57:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 349 states have (on average 1.5759312320916905) internal successors, (550), 399 states have internal predecessors, (550), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 581 transitions. [2025-03-09 05:57:24,867 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 581 transitions. Word has length 22 [2025-03-09 05:57:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 581 transitions. [2025-03-09 05:57:24,867 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-09 05:57:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 581 transitions. [2025-03-09 05:57:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:57:24,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:24,868 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-09 05:57:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:57:24,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1236192671, now seen corresponding path program 1 times [2025-03-09 05:57:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286861285] [2025-03-09 05:57:24,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:57:30,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:57:30,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:30,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:31,115 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-09 05:57:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286861285] [2025-03-09 05:57:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286861285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:57:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93655897] [2025-03-09 05:57:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:31,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:31,118 INFO L87 Difference]: Start difference. First operand 418 states and 581 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-09 05:57:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:31,604 INFO L93 Difference]: Finished difference Result 819 states and 1146 transitions. [2025-03-09 05:57:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:31,605 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-09 05:57:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:31,606 INFO L225 Difference]: With dead ends: 819 [2025-03-09 05:57:31,607 INFO L226 Difference]: Without dead ends: 421 [2025-03-09 05:57:31,607 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-09 05:57:31,607 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:31,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1089 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:57:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-09 05:57:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-09 05:57:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 352 states have (on average 1.5710227272727273) internal successors, (553), 402 states have internal predecessors, (553), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 584 transitions. [2025-03-09 05:57:31,621 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 584 transitions. Word has length 27 [2025-03-09 05:57:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 584 transitions. [2025-03-09 05:57:31,621 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-09 05:57:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions. [2025-03-09 05:57:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:57:31,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:31,622 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:57:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:57:31,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash -333066741, now seen corresponding path program 1 times [2025-03-09 05:57:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98748701] [2025-03-09 05:57:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:37,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:57:37,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:57:37,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:37,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:37,944 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-09 05:57:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98748701] [2025-03-09 05:57:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98748701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:37,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117341130] [2025-03-09 05:57:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:37,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:37,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:37,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:37,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:37,946 INFO L87 Difference]: Start difference. First operand 421 states and 584 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-09 05:57:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:38,572 INFO L93 Difference]: Finished difference Result 719 states and 1023 transitions. [2025-03-09 05:57:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:38,574 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 28 [2025-03-09 05:57:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:38,577 INFO L225 Difference]: With dead ends: 719 [2025-03-09 05:57:38,577 INFO L226 Difference]: Without dead ends: 717 [2025-03-09 05:57:38,578 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-09 05:57:38,578 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 411 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:38,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1076 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 05:57:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-09 05:57:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 425. [2025-03-09 05:57:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 356 states have (on average 1.5674157303370786) internal successors, (558), 406 states have internal predecessors, (558), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 589 transitions. [2025-03-09 05:57:38,593 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 589 transitions. Word has length 28 [2025-03-09 05:57:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:38,594 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 589 transitions. [2025-03-09 05:57:38,594 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-09 05:57:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 589 transitions. [2025-03-09 05:57:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:57:38,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:38,595 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-09 05:57:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:57:38,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1923161366, now seen corresponding path program 1 times [2025-03-09 05:57:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457199387] [2025-03-09 05:57:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:57:44,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:57:44,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:57:44,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:57:44,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:57:44,891 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-09 05:57:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:57:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457199387] [2025-03-09 05:57:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457199387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:57:44,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:57:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:57:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946987578] [2025-03-09 05:57:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:57:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:57:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:57:44,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:57:44,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:57:44,892 INFO L87 Difference]: Start difference. First operand 425 states and 589 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-09 05:57:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:57:45,378 INFO L93 Difference]: Finished difference Result 438 states and 604 transitions. [2025-03-09 05:57:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:57:45,378 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-09 05:57:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:57:45,380 INFO L225 Difference]: With dead ends: 438 [2025-03-09 05:57:45,380 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 05:57:45,380 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-09 05:57:45,381 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 3 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:57:45,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1086 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:57:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 05:57:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-09 05:57:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 365 states have (on average 1.5643835616438355) internal successors, (571), 415 states have internal predecessors, (571), 18 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:57:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 602 transitions. [2025-03-09 05:57:45,390 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 602 transitions. Word has length 30 [2025-03-09 05:57:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:57:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 602 transitions. [2025-03-09 05:57:45,391 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-09 05:57:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 602 transitions. [2025-03-09 05:57:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:57:45,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:57:45,391 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-09 05:57:45,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:57:45,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-03-09 05:57:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:57:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1923161206, now seen corresponding path program 1 times [2025-03-09 05:57:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:57:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336523191] [2025-03-09 05:57:45,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:57:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms