./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/who-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/who-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4bd2645d5d5ea7178c11bbac573ddbc3f4d38de676a99814ea3062e83a1e36f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:44:28,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:44:28,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:44:28,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:44:28,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:44:28,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:44:28,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:44:28,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:44:28,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:44:28,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:44:28,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:44:28,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:44:28,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:44:28,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:44:28,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:44:28,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:44:28,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:44:28,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:44:28,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:44:28,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:44:28,614 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 -> 4bd2645d5d5ea7178c11bbac573ddbc3f4d38de676a99814ea3062e83a1e36f0 [2025-03-04 14:44:28,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:44:28,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:44:28,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:44:28,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:44:28,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:44:28,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/who-1.i [2025-03-04 14:44:29,951 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55bdecff0/1e93dd22906e4df1b00de8d5e017c0bd/FLAG606603abf [2025-03-04 14:44:30,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:44:30,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-1.i [2025-03-04 14:44:30,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55bdecff0/1e93dd22906e4df1b00de8d5e017c0bd/FLAG606603abf [2025-03-04 14:44:30,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55bdecff0/1e93dd22906e4df1b00de8d5e017c0bd [2025-03-04 14:44:30,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:44:30,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:44:30,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:30,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:44:30,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:44:30,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:30" (1/1) ... [2025-03-04 14:44:30,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3190afde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:30, skipping insertion in model container [2025-03-04 14:44:30,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:44:30" (1/1) ... [2025-03-04 14:44:30,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:44:31,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:31,349 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:44:31,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:44:31,603 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:44:31,611 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:44:31,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31 WrapperNode [2025-03-04 14:44:31,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:44:31,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:31,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:44:31,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:44:31,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,687 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1979 [2025-03-04 14:44:31,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:44:31,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:44:31,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:44:31,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:44:31,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,738 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:44:31,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:44:31,818 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:44:31,818 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:44:31,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:44:31,819 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (1/1) ... [2025-03-04 14:44:31,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:44:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:31,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:44:31,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:44:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:44:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:44:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-04 14:44:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-04 14:44:31,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:44:31,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:44:31,863 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:44:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:44:32,214 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:44:32,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:44:33,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1; [2025-03-04 14:44:33,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591: 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-04 14:44:33,879 INFO L? ?]: Removed 637 outVars from TransFormulas that were not future-live. [2025-03-04 14:44:33,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:44:33,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:44:33,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:44:33,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:33 BoogieIcfgContainer [2025-03-04 14:44:33,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:44:33,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:44:33,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:44:33,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:44:33,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:44:30" (1/3) ... [2025-03-04 14:44:33,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4948ed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:33, skipping insertion in model container [2025-03-04 14:44:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:44:31" (2/3) ... [2025-03-04 14:44:33,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4948ed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:44:33, skipping insertion in model container [2025-03-04 14:44:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:44:33" (3/3) ... [2025-03-04 14:44:33,929 INFO L128 eAbstractionObserver]: Analyzing ICFG who-1.i [2025-03-04 14:44:33,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:44:33,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-1.i that has 6 procedures, 527 locations, 1 initial locations, 33 loop locations, and 78 error locations. [2025-03-04 14:44:33,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:44:34,004 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;@6e33dcfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:44:34,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-03-04 14:44:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 423 states have (on average 1.6808510638297873) internal successors, (711), 502 states have internal predecessors, (711), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 14:44:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:44:34,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:34,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:44:34,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:34,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash 27550655, now seen corresponding path program 1 times [2025-03-04 14:44:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:34,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794741738] [2025-03-04 14:44:34,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:34,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:44:34,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:44:34,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:34,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794741738] [2025-03-04 14:44:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794741738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172564576] [2025-03-04 14:44:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:34,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:34,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:34,565 INFO L87 Difference]: Start difference. First operand has 527 states, 423 states have (on average 1.6808510638297873) internal successors, (711), 502 states have internal predecessors, (711), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:34,688 INFO L93 Difference]: Finished difference Result 950 states and 1387 transitions. [2025-03-04 14:44:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:44:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:34,697 INFO L225 Difference]: With dead ends: 950 [2025-03-04 14:44:34,699 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 14:44:34,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:34,709 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1135 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:34,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 14:44:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-03-04 14:44:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 355 states have (on average 1.591549295774648) internal successors, (565), 406 states have internal predecessors, (565), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 593 transitions. [2025-03-04 14:44:34,774 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 593 transitions. Word has length 4 [2025-03-04 14:44:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:34,774 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 593 transitions. [2025-03-04 14:44:34,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 593 transitions. [2025-03-04 14:44:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:44:34,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:34,775 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:44:34,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:44:34,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 423632892, now seen corresponding path program 1 times [2025-03-04 14:44:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330283977] [2025-03-04 14:44:34,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:34,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:44:34,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:44:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:35,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330283977] [2025-03-04 14:44:35,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330283977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:35,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932160941] [2025-03-04 14:44:35,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:35,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:35,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:44:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:44:35,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:44:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:35,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:35,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:35,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932160941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:44:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368147539] [2025-03-04 14:44:35,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:35,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:35,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:35,477 INFO L87 Difference]: Start difference. First operand 424 states and 593 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:35,531 INFO L93 Difference]: Finished difference Result 424 states and 593 transitions. [2025-03-04 14:44:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:44:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:35,534 INFO L225 Difference]: With dead ends: 424 [2025-03-04 14:44:35,534 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 14:44:35,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:35,535 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1125 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:35,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1125 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 14:44:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-04 14:44:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 355 states have (on average 1.5887323943661973) internal successors, (564), 405 states have internal predecessors, (564), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 592 transitions. [2025-03-04 14:44:35,546 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 592 transitions. Word has length 7 [2025-03-04 14:44:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:35,547 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 592 transitions. [2025-03-04 14:44:35,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 592 transitions. [2025-03-04 14:44:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:44:35,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:35,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:44:35,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:35,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:35,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash 247718593, now seen corresponding path program 1 times [2025-03-04 14:44:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800573494] [2025-03-04 14:44:35,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:44:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:44:35,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:44:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800573494] [2025-03-04 14:44:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800573494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377054644] [2025-03-04 14:44:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:35,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:35,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:35,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:35,954 INFO L87 Difference]: Start difference. First operand 423 states and 592 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:36,008 INFO L93 Difference]: Finished difference Result 423 states and 592 transitions. [2025-03-04 14:44:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:36,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:44:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:36,010 INFO L225 Difference]: With dead ends: 423 [2025-03-04 14:44:36,010 INFO L226 Difference]: Without dead ends: 422 [2025-03-04 14:44:36,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:36,011 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 0 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1126 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:36,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1126 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-04 14:44:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-03-04 14:44:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 353 states have (on average 1.5892351274787535) internal successors, (561), 402 states have internal predecessors, (561), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2025-03-04 14:44:36,034 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 8 [2025-03-04 14:44:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:36,034 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2025-03-04 14:44:36,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:44:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2025-03-04 14:44:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:44:36,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:36,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:36,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:44:36,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1943989611, now seen corresponding path program 1 times [2025-03-04 14:44:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631529549] [2025-03-04 14:44:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:36,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:44:36,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:44:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631529549] [2025-03-04 14:44:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631529549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880477355] [2025-03-04 14:44:36,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:36,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:36,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:44:36,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:44:36,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:44:36,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:36,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:36,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:44:36,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:44:36,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880477355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:44:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285712441] [2025-03-04 14:44:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:36,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:36,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:36,681 INFO L87 Difference]: Start difference. First operand 420 states and 589 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:36,733 INFO L93 Difference]: Finished difference Result 420 states and 589 transitions. [2025-03-04 14:44:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:44:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:36,735 INFO L225 Difference]: With dead ends: 420 [2025-03-04 14:44:36,735 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 14:44:36,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:36,735 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 525 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:36,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 601 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 14:44:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-04 14:44:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 353 states have (on average 1.5835694050991502) internal successors, (559), 400 states have internal predecessors, (559), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2025-03-04 14:44:36,747 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 12 [2025-03-04 14:44:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:36,748 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2025-03-04 14:44:36,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2025-03-04 14:44:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:44:36,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:36,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:36,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:36,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:44:36,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash -134134974, now seen corresponding path program 1 times [2025-03-04 14:44:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:36,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947731347] [2025-03-04 14:44:36,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:37,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:44:37,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:44:37,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:37,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947731347] [2025-03-04 14:44:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947731347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685708562] [2025-03-04 14:44:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:37,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:37,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:44:37,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:44:37,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:44:37,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:37,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:37,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:37,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:44:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685708562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:37,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:44:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117489861] [2025-03-04 14:44:37,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:37,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:37,555 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:37,647 INFO L93 Difference]: Finished difference Result 839 states and 1179 transitions. [2025-03-04 14:44:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:44:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:37,651 INFO L225 Difference]: With dead ends: 839 [2025-03-04 14:44:37,652 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 14:44:37,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:37,654 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 4 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:37,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1682 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 14:44:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-03-04 14:44:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 362 states have (on average 1.569060773480663) internal successors, (568), 409 states have internal predecessors, (568), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 596 transitions. [2025-03-04 14:44:37,663 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 596 transitions. Word has length 13 [2025-03-04 14:44:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:37,663 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 596 transitions. [2025-03-04 14:44:37,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 596 transitions. [2025-03-04 14:44:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:44:37,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:37,664 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:37,673 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-04 14:44:37,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:37,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:37,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 908715653, now seen corresponding path program 2 times [2025-03-04 14:44:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143370082] [2025-03-04 14:44:37,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:37,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:44:38,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:44:38,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:44:38,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:44:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143370082] [2025-03-04 14:44:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143370082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:38,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:38,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159003533] [2025-03-04 14:44:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:38,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:44:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:38,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:44:38,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:38,190 INFO L87 Difference]: Start difference. First operand 427 states and 596 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:38,293 INFO L93 Difference]: Finished difference Result 427 states and 596 transitions. [2025-03-04 14:44:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:44:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:38,295 INFO L225 Difference]: With dead ends: 427 [2025-03-04 14:44:38,295 INFO L226 Difference]: Without dead ends: 425 [2025-03-04 14:44:38,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:38,296 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 524 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:38,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1686 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-04 14:44:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-04 14:44:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 407 states have internal predecessors, (566), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 594 transitions. [2025-03-04 14:44:38,306 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 594 transitions. Word has length 22 [2025-03-04 14:44:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 594 transitions. [2025-03-04 14:44:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 594 transitions. [2025-03-04 14:44:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:44:38,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:38,307 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:38,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:44:38,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:38,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash -943950483, now seen corresponding path program 1 times [2025-03-04 14:44:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732844246] [2025-03-04 14:44:38,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:38,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:44:38,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:44:38,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:44:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732844246] [2025-03-04 14:44:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732844246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:44:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473622303] [2025-03-04 14:44:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:38,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:38,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:38,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:38,525 INFO L87 Difference]: Start difference. First operand 425 states and 594 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:38,587 INFO L93 Difference]: Finished difference Result 833 states and 1172 transitions. [2025-03-04 14:44:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:44:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:38,591 INFO L225 Difference]: With dead ends: 833 [2025-03-04 14:44:38,591 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 14:44:38,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:38,593 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1115 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:38,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1115 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 14:44:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-04 14:44:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 365 states have (on average 1.558904109589041) internal successors, (569), 410 states have internal predecessors, (569), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 597 transitions. [2025-03-04 14:44:38,614 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 597 transitions. Word has length 27 [2025-03-04 14:44:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:38,615 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 597 transitions. [2025-03-04 14:44:38,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 597 transitions. [2025-03-04 14:44:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 14:44:38,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:38,616 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-04 14:44:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:44:38,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:38,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash 801972255, now seen corresponding path program 1 times [2025-03-04 14:44:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374359918] [2025-03-04 14:44:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:38,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 14:44:38,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 14:44:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:38,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:44:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374359918] [2025-03-04 14:44:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374359918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808331232] [2025-03-04 14:44:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:38,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:38,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:38,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:38,840 INFO L87 Difference]: Start difference. First operand 428 states and 597 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:38,926 INFO L93 Difference]: Finished difference Result 726 states and 1035 transitions. [2025-03-04 14:44:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:38,926 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-04 14:44:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:38,929 INFO L225 Difference]: With dead ends: 726 [2025-03-04 14:44:38,929 INFO L226 Difference]: Without dead ends: 724 [2025-03-04 14:44:38,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:38,929 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 412 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1102 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1102 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-04 14:44:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 432. [2025-03-04 14:44:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 369 states have (on average 1.5555555555555556) internal successors, (574), 414 states have internal predecessors, (574), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 602 transitions. [2025-03-04 14:44:38,945 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 602 transitions. Word has length 28 [2025-03-04 14:44:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:38,945 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 602 transitions. [2025-03-04 14:44:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 602 transitions. [2025-03-04 14:44:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:44:38,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:38,946 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:38,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:44:38,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2072378306, now seen corresponding path program 1 times [2025-03-04 14:44:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536992729] [2025-03-04 14:44:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:39,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:44:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:44:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:44:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536992729] [2025-03-04 14:44:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536992729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:39,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:39,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387250000] [2025-03-04 14:44:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:39,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:39,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:39,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:39,151 INFO L87 Difference]: Start difference. First operand 432 states and 602 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:39,210 INFO L93 Difference]: Finished difference Result 445 states and 617 transitions. [2025-03-04 14:44:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:44:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:39,212 INFO L225 Difference]: With dead ends: 445 [2025-03-04 14:44:39,212 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 14:44:39,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:39,213 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 3 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1112 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:39,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1112 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 14:44:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2025-03-04 14:44:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 378 states have (on average 1.552910052910053) internal successors, (587), 423 states have internal predecessors, (587), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 615 transitions. [2025-03-04 14:44:39,224 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 615 transitions. Word has length 30 [2025-03-04 14:44:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:39,224 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 615 transitions. [2025-03-04 14:44:39,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 615 transitions. [2025-03-04 14:44:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:44:39,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:39,225 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:39,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:44:39,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:39,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2072378146, now seen corresponding path program 1 times [2025-03-04 14:44:39,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:39,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685029817] [2025-03-04 14:44:39,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:39,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:44:39,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:44:39,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:44:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685029817] [2025-03-04 14:44:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685029817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540493691] [2025-03-04 14:44:39,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:39,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:39,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:39,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:44:39,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:44:39,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:44:39,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:39,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:39,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:39,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:44:39,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:44:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540493691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:40,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:44:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198009781] [2025-03-04 14:44:40,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:44:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:44:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:40,014 INFO L87 Difference]: Start difference. First operand 441 states and 615 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:44:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:40,227 INFO L93 Difference]: Finished difference Result 884 states and 1238 transitions. [2025-03-04 14:44:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:44:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:44:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:40,229 INFO L225 Difference]: With dead ends: 884 [2025-03-04 14:44:40,230 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 14:44:40,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:40,233 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 5 mSDsluCounter, 3864 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4418 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4418 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 14:44:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-03-04 14:44:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 396 states have (on average 1.5227272727272727) internal successors, (603), 440 states have internal predecessors, (603), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 631 transitions. [2025-03-04 14:44:40,250 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 631 transitions. Word has length 30 [2025-03-04 14:44:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 631 transitions. [2025-03-04 14:44:40,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:44:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 631 transitions. [2025-03-04 14:44:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:44:40,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:40,253 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:40,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:40,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:40,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:40,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1509786257, now seen corresponding path program 1 times [2025-03-04 14:44:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:40,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674939696] [2025-03-04 14:44:40,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:40,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:44:40,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:44:40,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:40,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:44:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674939696] [2025-03-04 14:44:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674939696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:40,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:40,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130194467] [2025-03-04 14:44:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:40,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:40,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:40,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:40,666 INFO L87 Difference]: Start difference. First operand 458 states and 631 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:40,715 INFO L93 Difference]: Finished difference Result 458 states and 631 transitions. [2025-03-04 14:44:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:44:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:40,717 INFO L225 Difference]: With dead ends: 458 [2025-03-04 14:44:40,717 INFO L226 Difference]: Without dead ends: 457 [2025-03-04 14:44:40,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:40,718 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:40,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1113 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-04 14:44:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2025-03-04 14:44:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 392 states have (on average 1.5229591836734695) internal successors, (597), 435 states have internal predecessors, (597), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 625 transitions. [2025-03-04 14:44:40,732 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 625 transitions. Word has length 49 [2025-03-04 14:44:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:40,733 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 625 transitions. [2025-03-04 14:44:40,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 625 transitions. [2025-03-04 14:44:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:44:40,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:40,734 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:44:40,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash 329902083, now seen corresponding path program 1 times [2025-03-04 14:44:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917121273] [2025-03-04 14:44:40,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:40,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:44:40,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:44:40,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:40,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917121273] [2025-03-04 14:44:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917121273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788346086] [2025-03-04 14:44:40,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:40,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:40,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:40,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:44:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:44:41,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:44:41,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:41,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:41,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:41,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788346086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:44:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672609069] [2025-03-04 14:44:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:41,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:41,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:41,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:41,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:41,488 INFO L87 Difference]: Start difference. First operand 453 states and 625 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:41,607 INFO L93 Difference]: Finished difference Result 749 states and 1061 transitions. [2025-03-04 14:44:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 50 [2025-03-04 14:44:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:41,611 INFO L225 Difference]: With dead ends: 749 [2025-03-04 14:44:41,611 INFO L226 Difference]: Without dead ends: 748 [2025-03-04 14:44:41,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:41,612 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 823 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:41,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1511 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-04 14:44:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 452. [2025-03-04 14:44:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 392 states have (on average 1.5204081632653061) internal successors, (596), 434 states have internal predecessors, (596), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 624 transitions. [2025-03-04 14:44:41,627 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 624 transitions. Word has length 50 [2025-03-04 14:44:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 624 transitions. [2025-03-04 14:44:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 624 transitions. [2025-03-04 14:44:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:44:41,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:41,630 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:41,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:44:41,831 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1637030780, now seen corresponding path program 1 times [2025-03-04 14:44:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316193177] [2025-03-04 14:44:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:41,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:44:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:44:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316193177] [2025-03-04 14:44:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316193177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514853063] [2025-03-04 14:44:42,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:42,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:42,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:42,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:44:42,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:44:42,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:44:42,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:42,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:42,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:42,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:42,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514853063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:42,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:44:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178757932] [2025-03-04 14:44:42,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:42,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:42,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:42,546 INFO L87 Difference]: Start difference. First operand 452 states and 624 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:42,755 INFO L93 Difference]: Finished difference Result 1633 states and 2366 transitions. [2025-03-04 14:44:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-04 14:44:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:42,761 INFO L225 Difference]: With dead ends: 1633 [2025-03-04 14:44:42,761 INFO L226 Difference]: Without dead ends: 1632 [2025-03-04 14:44:42,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:42,762 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2507 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:42,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 2828 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:44:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-03-04 14:44:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 464. [2025-03-04 14:44:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 404 states have (on average 1.5123762376237624) internal successors, (611), 446 states have internal predecessors, (611), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 639 transitions. [2025-03-04 14:44:42,781 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 639 transitions. Word has length 51 [2025-03-04 14:44:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:42,781 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 639 transitions. [2025-03-04 14:44:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 639 transitions. [2025-03-04 14:44:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:44:42,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:42,782 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:42,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:42,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:42,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:42,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1537395419, now seen corresponding path program 1 times [2025-03-04 14:44:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953256259] [2025-03-04 14:44:42,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:43,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:44:43,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:44:43,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:43,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:44:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953256259] [2025-03-04 14:44:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953256259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030526684] [2025-03-04 14:44:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:43,211 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:44:43,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:44:43,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:44:43,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:43,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:43,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:44:43,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:44:43,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:44:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030526684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:43,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:44:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52476031] [2025-03-04 14:44:43,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:43,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:44:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:43,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:44:43,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:43,682 INFO L87 Difference]: Start difference. First operand 464 states and 639 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:43,748 INFO L93 Difference]: Finished difference Result 903 states and 1255 transitions. [2025-03-04 14:44:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:44:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:43,750 INFO L225 Difference]: With dead ends: 903 [2025-03-04 14:44:43,750 INFO L226 Difference]: Without dead ends: 482 [2025-03-04 14:44:43,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:44:43,751 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 4 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:43,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1665 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-04 14:44:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-03-04 14:44:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 422 states have (on average 1.490521327014218) internal successors, (629), 464 states have internal predecessors, (629), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:44:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 657 transitions. [2025-03-04 14:44:43,762 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 657 transitions. Word has length 55 [2025-03-04 14:44:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 657 transitions. [2025-03-04 14:44:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 657 transitions. [2025-03-04 14:44:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 14:44:43,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:43,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:43,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:43,964 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash -732562005, now seen corresponding path program 1 times [2025-03-04 14:44:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028578781] [2025-03-04 14:44:43,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 14:44:44,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 14:44:44,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:44,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028578781] [2025-03-04 14:44:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028578781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714857148] [2025-03-04 14:44:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:44,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:44,176 INFO L87 Difference]: Start difference. First operand 482 states and 657 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:44:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:44,278 INFO L93 Difference]: Finished difference Result 959 states and 1340 transitions. [2025-03-04 14:44:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-04 14:44:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:44,280 INFO L225 Difference]: With dead ends: 959 [2025-03-04 14:44:44,280 INFO L226 Difference]: Without dead ends: 577 [2025-03-04 14:44:44,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:44,282 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 118 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:44,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1061 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-04 14:44:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 524. [2025-03-04 14:44:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4794816414686824) internal successors, (685), 505 states have internal predecessors, (685), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 715 transitions. [2025-03-04 14:44:44,294 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 715 transitions. Word has length 60 [2025-03-04 14:44:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:44,295 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 715 transitions. [2025-03-04 14:44:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:44:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 715 transitions. [2025-03-04 14:44:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:44:44,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:44,296 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:44,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:44:44,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 382574537, now seen corresponding path program 1 times [2025-03-04 14:44:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:44,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003308236] [2025-03-04 14:44:44,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:44,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:44:44,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:44:44,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:44,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:44:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003308236] [2025-03-04 14:44:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003308236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834586189] [2025-03-04 14:44:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:44,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:44,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:44,464 INFO L87 Difference]: Start difference. First operand 524 states and 715 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:44,511 INFO L93 Difference]: Finished difference Result 526 states and 715 transitions. [2025-03-04 14:44:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-03-04 14:44:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:44,513 INFO L225 Difference]: With dead ends: 526 [2025-03-04 14:44:44,513 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 14:44:44,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:44,513 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:44,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1111 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 14:44:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-04 14:44:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4751619870410366) internal successors, (683), 505 states have internal predecessors, (683), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 713 transitions. [2025-03-04 14:44:44,542 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 713 transitions. Word has length 62 [2025-03-04 14:44:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:44,543 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 713 transitions. [2025-03-04 14:44:44,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2025-03-04 14:44:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 14:44:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:44,543 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:44:44,544 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1713509168, now seen corresponding path program 2 times [2025-03-04 14:44:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661802892] [2025-03-04 14:44:44,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:44,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-04 14:44:44,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-04 14:44:44,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:44:44,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 14:44:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661802892] [2025-03-04 14:44:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661802892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:44:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139149519] [2025-03-04 14:44:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:44:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:44:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:44,912 INFO L87 Difference]: Start difference. First operand 524 states and 713 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:45,056 INFO L93 Difference]: Finished difference Result 976 states and 1348 transitions. [2025-03-04 14:44:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:44:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-03-04 14:44:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:45,058 INFO L225 Difference]: With dead ends: 976 [2025-03-04 14:44:45,058 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 14:44:45,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:45,059 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 531 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:45,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2157 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 14:44:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-04 14:44:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 463 states have (on average 1.4730021598272138) internal successors, (682), 505 states have internal predecessors, (682), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 712 transitions. [2025-03-04 14:44:45,074 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 712 transitions. Word has length 63 [2025-03-04 14:44:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:45,076 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 712 transitions. [2025-03-04 14:44:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 712 transitions. [2025-03-04 14:44:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:44:45,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:45,077 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:45,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:44:45,077 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1153980373, now seen corresponding path program 2 times [2025-03-04 14:44:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438553076] [2025-03-04 14:44:45,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:45,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:44:45,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:44:45,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:45,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:44:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438553076] [2025-03-04 14:44:45,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438553076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:45,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926779660] [2025-03-04 14:44:45,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:44:45,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:45,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:45,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:44:45,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:44:47,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:44:47,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:44:47,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:47,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:47,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:44:47,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:44:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926779660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:47,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:44:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640711236] [2025-03-04 14:44:47,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:44:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:44:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:44:47,777 INFO L87 Difference]: Start difference. First operand 524 states and 712 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:48,091 INFO L93 Difference]: Finished difference Result 1031 states and 1417 transitions. [2025-03-04 14:44:48,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 14:44:48,093 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-04 14:44:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:48,095 INFO L225 Difference]: With dead ends: 1031 [2025-03-04 14:44:48,095 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 14:44:48,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 14:44:48,097 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 9 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:48,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2748 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 14:44:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-04 14:44:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 499 states have (on average 1.43687374749499) internal successors, (717), 540 states have internal predecessors, (717), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 747 transitions. [2025-03-04 14:44:48,111 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 747 transitions. Word has length 73 [2025-03-04 14:44:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:48,111 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 747 transitions. [2025-03-04 14:44:48,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 747 transitions. [2025-03-04 14:44:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:44:48,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:48,112 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:48,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:48,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 14:44:48,313 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:48,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1363251560, now seen corresponding path program 1 times [2025-03-04 14:44:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:48,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773678069] [2025-03-04 14:44:48,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:48,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:48,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773678069] [2025-03-04 14:44:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773678069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635782625] [2025-03-04 14:44:48,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:48,653 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:48,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:44:49,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:44:49,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:44:49,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:49,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:44:49,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:49,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635782625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:44:49,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:44:49,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 14:44:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076093046] [2025-03-04 14:44:49,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:49,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:44:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:49,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:44:49,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:49,300 INFO L87 Difference]: Start difference. First operand 559 states and 747 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:49,800 INFO L93 Difference]: Finished difference Result 3924 states and 5653 transitions. [2025-03-04 14:44:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:44:49,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-03-04 14:44:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:49,811 INFO L225 Difference]: With dead ends: 3924 [2025-03-04 14:44:49,811 INFO L226 Difference]: Without dead ends: 3923 [2025-03-04 14:44:49,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:44:49,812 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 7132 mSDsluCounter, 5483 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7202 SdHoareTripleChecker+Valid, 6034 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:49,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7202 Valid, 6034 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:44:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2025-03-04 14:44:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 583. [2025-03-04 14:44:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 523 states have (on average 1.4282982791586998) internal successors, (747), 564 states have internal predecessors, (747), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 777 transitions. [2025-03-04 14:44:49,847 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 777 transitions. Word has length 97 [2025-03-04 14:44:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:49,848 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 777 transitions. [2025-03-04 14:44:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:44:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 777 transitions. [2025-03-04 14:44:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:49,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:49,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:49,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 14:44:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:50,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875590, now seen corresponding path program 1 times [2025-03-04 14:44:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107784571] [2025-03-04 14:44:50,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:50,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:50,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107784571] [2025-03-04 14:44:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107784571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655522072] [2025-03-04 14:44:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:50,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:50,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:50,246 INFO L87 Difference]: Start difference. First operand 583 states and 777 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:50,359 INFO L93 Difference]: Finished difference Result 961 states and 1331 transitions. [2025-03-04 14:44:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-04 14:44:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:50,361 INFO L225 Difference]: With dead ends: 961 [2025-03-04 14:44:50,361 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 14:44:50,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:50,362 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 74 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:50,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1114 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 14:44:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 586. [2025-03-04 14:44:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 528 states have (on average 1.4223484848484849) internal successors, (751), 567 states have internal predecessors, (751), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 781 transitions. [2025-03-04 14:44:50,378 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 781 transitions. Word has length 102 [2025-03-04 14:44:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:50,378 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 781 transitions. [2025-03-04 14:44:50,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 781 transitions. [2025-03-04 14:44:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 14:44:50,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:50,379 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:50,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:44:50,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1895598915, now seen corresponding path program 1 times [2025-03-04 14:44:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087130587] [2025-03-04 14:44:50,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:50,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 14:44:50,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 14:44:50,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:50,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087130587] [2025-03-04 14:44:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087130587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039370285] [2025-03-04 14:44:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:50,646 INFO L87 Difference]: Start difference. First operand 586 states and 781 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:50,759 INFO L93 Difference]: Finished difference Result 639 states and 859 transitions. [2025-03-04 14:44:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-04 14:44:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:50,761 INFO L225 Difference]: With dead ends: 639 [2025-03-04 14:44:50,761 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 14:44:50,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:50,762 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 189 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:50,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 929 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 14:44:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 583. [2025-03-04 14:44:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 528 states have (on average 1.4166666666666667) internal successors, (748), 564 states have internal predecessors, (748), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 778 transitions. [2025-03-04 14:44:50,782 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 778 transitions. Word has length 102 [2025-03-04 14:44:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 778 transitions. [2025-03-04 14:44:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 778 transitions. [2025-03-04 14:44:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:44:50,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:50,783 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:50,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:44:50,783 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:50,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1233399391, now seen corresponding path program 1 times [2025-03-04 14:44:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363817870] [2025-03-04 14:44:50,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:50,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:50,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:44:50,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:44:50,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:50,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363817870] [2025-03-04 14:44:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363817870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:50,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941816674] [2025-03-04 14:44:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:50,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:50,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:50,990 INFO L87 Difference]: Start difference. First operand 583 states and 778 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:51,126 INFO L93 Difference]: Finished difference Result 963 states and 1333 transitions. [2025-03-04 14:44:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 14:44:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:51,128 INFO L225 Difference]: With dead ends: 963 [2025-03-04 14:44:51,128 INFO L226 Difference]: Without dead ends: 633 [2025-03-04 14:44:51,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:51,132 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 155 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:51,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1004 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-04 14:44:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 568. [2025-03-04 14:44:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 517 states have (on average 1.4081237911025144) internal successors, (728), 549 states have internal predecessors, (728), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 758 transitions. [2025-03-04 14:44:51,158 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 758 transitions. Word has length 103 [2025-03-04 14:44:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:51,158 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 758 transitions. [2025-03-04 14:44:51,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 758 transitions. [2025-03-04 14:44:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 14:44:51,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:51,159 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:44:51,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1365976355, now seen corresponding path program 1 times [2025-03-04 14:44:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304111811] [2025-03-04 14:44:51,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:51,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 14:44:51,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 14:44:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304111811] [2025-03-04 14:44:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304111811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:51,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:51,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118495935] [2025-03-04 14:44:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:51,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:51,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:51,425 INFO L87 Difference]: Start difference. First operand 568 states and 758 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:51,523 INFO L93 Difference]: Finished difference Result 621 states and 836 transitions. [2025-03-04 14:44:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 14:44:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:51,526 INFO L225 Difference]: With dead ends: 621 [2025-03-04 14:44:51,526 INFO L226 Difference]: Without dead ends: 620 [2025-03-04 14:44:51,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:51,527 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 186 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:51,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 960 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-04 14:44:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 567. [2025-03-04 14:44:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 517 states have (on average 1.4061895551257253) internal successors, (727), 548 states have internal predecessors, (727), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 757 transitions. [2025-03-04 14:44:51,543 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 757 transitions. Word has length 103 [2025-03-04 14:44:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:51,544 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 757 transitions. [2025-03-04 14:44:51,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 757 transitions. [2025-03-04 14:44:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 14:44:51,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:51,544 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:44:51,545 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash -715423535, now seen corresponding path program 1 times [2025-03-04 14:44:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844661912] [2025-03-04 14:44:51,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:51,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 14:44:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 14:44:51,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844661912] [2025-03-04 14:44:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844661912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500642050] [2025-03-04 14:44:51,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:51,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:51,836 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:51,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:44:52,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 14:44:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 14:44:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:52,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:44:52,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:52,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:44:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500642050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:44:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 14:44:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789673093] [2025-03-04 14:44:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:44:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:52,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:44:52,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:52,551 INFO L87 Difference]: Start difference. First operand 567 states and 757 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:44:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:52,712 INFO L93 Difference]: Finished difference Result 1062 states and 1468 transitions. [2025-03-04 14:44:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:52,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-03-04 14:44:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:52,715 INFO L225 Difference]: With dead ends: 1062 [2025-03-04 14:44:52,715 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 14:44:52,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:44:52,716 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 348 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:52,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1370 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 14:44:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 566. [2025-03-04 14:44:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 518 states have (on average 1.3976833976833978) internal successors, (724), 547 states have internal predecessors, (724), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 754 transitions. [2025-03-04 14:44:52,735 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 754 transitions. Word has length 105 [2025-03-04 14:44:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:52,736 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 754 transitions. [2025-03-04 14:44:52,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:44:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2025-03-04 14:44:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:44:52,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:52,738 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:52,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 14:44:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 14:44:52,939 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1554032257, now seen corresponding path program 1 times [2025-03-04 14:44:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056731142] [2025-03-04 14:44:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:53,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:44:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:44:53,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:53,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-04 14:44:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056731142] [2025-03-04 14:44:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056731142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:44:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336485754] [2025-03-04 14:44:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:53,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:44:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:53,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:44:53,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:53,144 INFO L87 Difference]: Start difference. First operand 566 states and 754 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:53,195 INFO L93 Difference]: Finished difference Result 566 states and 754 transitions. [2025-03-04 14:44:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:44:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-04 14:44:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:53,198 INFO L225 Difference]: With dead ends: 566 [2025-03-04 14:44:53,198 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 14:44:53,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:44:53,198 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:53,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1085 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 14:44:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-03-04 14:44:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 518 states have (on average 1.3957528957528957) internal successors, (723), 546 states have internal predecessors, (723), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 753 transitions. [2025-03-04 14:44:53,216 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 753 transitions. Word has length 108 [2025-03-04 14:44:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:53,216 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 753 transitions. [2025-03-04 14:44:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 753 transitions. [2025-03-04 14:44:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:44:53,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:53,219 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 14:44:53,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting bb_error_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1891542668, now seen corresponding path program 1 times [2025-03-04 14:44:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592456857] [2025-03-04 14:44:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:53,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:53,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:53,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:53,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:53,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592456857] [2025-03-04 14:44:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592456857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30908823] [2025-03-04 14:44:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:53,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:53,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:44:53,520 INFO L87 Difference]: Start difference. First operand 565 states and 753 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:53,581 INFO L93 Difference]: Finished difference Result 574 states and 761 transitions. [2025-03-04 14:44:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:44:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2025-03-04 14:44:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:53,584 INFO L225 Difference]: With dead ends: 574 [2025-03-04 14:44:53,584 INFO L226 Difference]: Without dead ends: 571 [2025-03-04 14:44:53,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:53,585 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 8 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:53,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1626 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:44:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-04 14:44:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 568. [2025-03-04 14:44:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 521 states have (on average 1.3934740882917467) internal successors, (726), 548 states have internal predecessors, (726), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:44:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 756 transitions. [2025-03-04 14:44:53,600 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 756 transitions. Word has length 110 [2025-03-04 14:44:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:53,600 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 756 transitions. [2025-03-04 14:44:53,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 756 transitions. [2025-03-04 14:44:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:44:53,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:53,602 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:53,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 14:44:53,602 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting bb_error_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1891541707, now seen corresponding path program 1 times [2025-03-04 14:44:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100276790] [2025-03-04 14:44:53,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:53,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:44:53,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:44:53,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:53,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:54,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100276790] [2025-03-04 14:44:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100276790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:44:54,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:44:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:44:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982767016] [2025-03-04 14:44:54,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:44:54,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:44:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:54,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:44:54,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:44:54,203 INFO L87 Difference]: Start difference. First operand 568 states and 756 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:44:54,281 INFO L93 Difference]: Finished difference Result 988 states and 1351 transitions. [2025-03-04 14:44:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:44:54,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2025-03-04 14:44:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:44:54,287 INFO L225 Difference]: With dead ends: 988 [2025-03-04 14:44:54,288 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 14:44:54,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:44:54,289 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:44:54,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1623 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:44:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 14:44:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2025-03-04 14:44:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 525 states have (on average 1.3942857142857144) internal successors, (732), 552 states have internal predecessors, (732), 17 states have call successors, (17), 7 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-04 14:44:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 763 transitions. [2025-03-04 14:44:54,313 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 763 transitions. Word has length 110 [2025-03-04 14:44:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:44:54,313 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 763 transitions. [2025-03-04 14:44:54,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:44:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 763 transitions. [2025-03-04 14:44:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 14:44:54,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:44:54,315 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:44:54,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 14:44:54,315 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting bb_error_msg_and_dieErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:44:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:44:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1757994640, now seen corresponding path program 1 times [2025-03-04 14:44:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:44:54,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635343181] [2025-03-04 14:44:54,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:44:54,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 14:44:54,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 14:44:54,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:54,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 14:44:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:44:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635343181] [2025-03-04 14:44:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635343181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988670001] [2025-03-04 14:44:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:44:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:44:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:44:54,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:44:54,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:44:55,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 14:44:55,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 14:44:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:44:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:44:55,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1983 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-03-04 14:44:55,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:44:55,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:55,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:55,820 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 14:44:55,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 14:44:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:55,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:55,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,464 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 14:44:56,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-04 14:44:56,578 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-04 14:44:56,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-04 14:44:56,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-03-04 14:44:56,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-03-04 14:44:56,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,755 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-03-04 14:44:56,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 90 [2025-03-04 14:44:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-03-04 14:44:56,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-03-04 14:44:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,818 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-04 14:44:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 101 [2025-03-04 14:44:56,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-03-04 14:44:56,863 INFO L349 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2025-03-04 14:44:56,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 73 [2025-03-04 14:44:56,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-03-04 14:44:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-03-04 14:44:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,946 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-04 14:44:56,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 84 [2025-03-04 14:44:56,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-03-04 14:44:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:56,970 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-04 14:44:56,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 90 [2025-03-04 14:44:57,074 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:57,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:57,231 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:57,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:57,440 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:57,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:57,629 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:57,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:57,804 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:57,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:57,981 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:57,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:58,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:58,144 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:58,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:58,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:58,300 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:58,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:58,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:58,453 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 14:44:58,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 99 [2025-03-04 14:44:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-04 14:44:58,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 30 [2025-03-04 14:44:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:59,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:59,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:59,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:44:59,282 INFO L349 Elim1Store]: treesize reduction 33, result has 49.2 percent of original size [2025-03-04 14:44:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 66 [2025-03-04 14:44:59,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:44:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-04 14:44:59,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:44:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988670001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:44:59,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:44:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 19 [2025-03-04 14:44:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647859601] [2025-03-04 14:44:59,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:44:59,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 14:44:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:44:59,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 14:44:59,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=483, Unknown=1, NotChecked=0, Total=552 [2025-03-04 14:44:59,767 INFO L87 Difference]: Start difference. First operand 573 states and 763 transitions. Second operand has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 14:45:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:15,772 INFO L93 Difference]: Finished difference Result 1517 states and 2124 transitions. [2025-03-04 14:45:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 14:45:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 111 [2025-03-04 14:45:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:15,776 INFO L225 Difference]: With dead ends: 1517 [2025-03-04 14:45:15,776 INFO L226 Difference]: Without dead ends: 1096 [2025-03-04 14:45:15,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=253, Invalid=1304, Unknown=3, NotChecked=0, Total=1560 [2025-03-04 14:45:15,778 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2121 mSDsluCounter, 5473 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 5954 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:45:15,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 5954 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-04 14:45:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-03-04 14:45:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 627. [2025-03-04 14:45:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 576 states have (on average 1.3940972222222223) internal successors, (803), 602 states have internal predecessors, (803), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 14:45:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 835 transitions. [2025-03-04 14:45:15,822 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 835 transitions. Word has length 111 [2025-03-04 14:45:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 835 transitions. [2025-03-04 14:45:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.666666666666667) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 14:45:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 835 transitions. [2025-03-04 14:45:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:45:15,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:15,823 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:45:15,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 14:45:16,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 14:45:16,024 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:45:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 233023923, now seen corresponding path program 1 times [2025-03-04 14:45:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:45:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977285659] [2025-03-04 14:45:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:45:16,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:45:16,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:45:16,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:45:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:45:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977285659] [2025-03-04 14:45:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977285659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:45:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993755448] [2025-03-04 14:45:16,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:16,330 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:45:16,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:45:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:45:16,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:45:16,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:16,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:17,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:45:17,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:45:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:45:17,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:45:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 14:45:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993755448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:45:17,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:45:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:45:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066019623] [2025-03-04 14:45:17,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:45:17,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:45:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:45:17,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:45:17,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:45:17,136 INFO L87 Difference]: Start difference. First operand 627 states and 835 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:45:17,256 INFO L93 Difference]: Finished difference Result 730 states and 946 transitions. [2025-03-04 14:45:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:45:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-04 14:45:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:45:17,259 INFO L225 Difference]: With dead ends: 730 [2025-03-04 14:45:17,259 INFO L226 Difference]: Without dead ends: 729 [2025-03-04 14:45:17,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:45:17,259 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:45:17,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2158 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:45:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-04 14:45:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-03-04 14:45:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 678 states have (on average 1.3436578171091444) internal successors, (911), 704 states have internal predecessors, (911), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 14:45:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 943 transitions. [2025-03-04 14:45:17,310 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 943 transitions. Word has length 110 [2025-03-04 14:45:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:45:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 943 transitions. [2025-03-04 14:45:17,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:45:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 943 transitions. [2025-03-04 14:45:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 14:45:17,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:45:17,311 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:45:17,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 14:45:17,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 14:45:17,512 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-03-04 14:45:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:45:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 758694404, now seen corresponding path program 1 times [2025-03-04 14:45:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:45:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835420636] [2025-03-04 14:45:17,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:45:17,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 14:45:17,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 14:45:17,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:17,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-04 14:45:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:45:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835420636] [2025-03-04 14:45:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835420636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:45:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168108067] [2025-03-04 14:45:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:45:17,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:45:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:45:17,980 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:45:17,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 14:45:18,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 14:45:18,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 14:45:18,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:45:18,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:45:18,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1927 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-04 14:45:18,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:45:18,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:18,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,784 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 14:45:18,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 14:45:18,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:18,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,184 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 14:45:19,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-04 14:45:19,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:19,256 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-04 14:45:19,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-04 14:45:19,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-04 14:45:19,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2025-03-04 14:45:19,351 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 109 [2025-03-04 14:45:19,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-03-04 14:45:19,376 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-04 14:45:19,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-03-04 14:45:19,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-04 14:45:19,403 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2025-03-04 14:45:19,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 93 [2025-03-04 14:45:19,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2025-03-04 14:45:19,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-03-04 14:45:19,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-03-04 14:45:19,482 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:19,494 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:19,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:19,602 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:19,628 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:19,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:19,725 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:19,749 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:19,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:19,828 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:19,850 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:19,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:19,928 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:19,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:19,938 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:20,026 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:20,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:20,044 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:20,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:20,124 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:20,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:20,144 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:20,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:20,231 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:20,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:20,273 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:20,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:20,353 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 14:45:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-03-04 14:45:20,371 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-04 14:45:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 14:45:20,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 24 [2025-03-04 14:45:20,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 14:45:20,566 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_10| Int) (|#Ultimate.C_memset_#ptr.base| Int)) (and (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_10| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_10|))) is different from true [2025-03-04 14:45:20,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 14:45:20,594 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 14:45:20,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-04 14:45:20,745 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-03-04 14:45:20,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 64 [2025-03-04 14:45:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 241 trivial. 2 not checked. [2025-03-04 14:45:20,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:45:29,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9385 (Array Int Int))) (not (= 33 (select (select (let ((.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9378))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9379))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_9381))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9377) .cse1 v_ArrVal_9380) .cse2 v_ArrVal_9382) .cse3 v_ArrVal_9384) (select (select (store .cse4 .cse3 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_9385))))))))) 11) 0)))) is different from false [2025-03-04 14:45:29,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9385 (Array Int Int))) (not (= (select (select (let ((.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9375))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_9378))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_9379))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_9381))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9376) .cse1 v_ArrVal_9377) .cse2 v_ArrVal_9380) .cse3 v_ArrVal_9382) .cse4 v_ArrVal_9384) (select (select (store .cse5 .cse4 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_9385))))))))))) 11) 0) 33))) is different from false [2025-03-04 14:45:29,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= (select (select (let ((.cse7 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9373))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_9375))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_9378))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_9379))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_9381))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9374) .cse1 v_ArrVal_9376) .cse2 v_ArrVal_9377) .cse3 v_ArrVal_9380) .cse4 v_ArrVal_9382) .cse5 v_ArrVal_9384) (select (select (store .cse6 .cse5 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_9385))))))))))))) 11) 0) 33))) is different from false [2025-03-04 14:45:29,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= (select (select (let ((.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9372))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_9373))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_9375))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_9378))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_9379))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_9381))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9371) .cse1 v_ArrVal_9374) .cse2 v_ArrVal_9376) .cse3 v_ArrVal_9377) .cse4 v_ArrVal_9380) .cse5 v_ArrVal_9382) .cse6 v_ArrVal_9384) (select (select (store .cse7 .cse6 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_9385))))))))))))))) 11) 0) 33))) is different from false [2025-03-04 14:45:30,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9369 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= 33 (select (select (let ((.cse9 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9369))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_9372))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_9373))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_9375))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_9378))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_9379))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_9381))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9370) .cse1 v_ArrVal_9371) .cse2 v_ArrVal_9374) .cse3 v_ArrVal_9376) .cse4 v_ArrVal_9377) .cse5 v_ArrVal_9380) .cse6 v_ArrVal_9382) .cse7 v_ArrVal_9384) (select (select (store .cse8 .cse7 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_9385))))))))))))))))) 11) 0)))) is different from false [2025-03-04 14:45:33,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9371 (Array Int Int)) (v_ArrVal_9382 (Array Int Int)) (v_ArrVal_9372 (Array Int Int)) (v_ArrVal_9383 (Array Int Int)) (v_ArrVal_9380 (Array Int Int)) (v_ArrVal_9370 (Array Int Int)) (v_ArrVal_9381 (Array Int Int)) (v_ArrVal_9375 (Array Int Int)) (v_ArrVal_9376 (Array Int Int)) (v_ArrVal_9373 (Array Int Int)) (v_ArrVal_9384 (Array Int Int)) (v_ArrVal_9374 (Array Int Int)) (v_ArrVal_9385 (Array Int Int)) (v_ArrVal_9368 (Array Int Int)) (v_ArrVal_9379 (Array Int Int)) (v_ArrVal_9369 (Array Int Int)) (v_ArrVal_9377 (Array Int Int)) (v_ArrVal_9367 (Array Int Int)) (v_ArrVal_9378 (Array Int Int))) (not (= 33 (select (select (let ((.cse10 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9368))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_9369))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_9372))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_9373))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_9375))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_9378))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_9379))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_9381))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9367) .cse1 v_ArrVal_9370) .cse2 v_ArrVal_9371) .cse3 v_ArrVal_9374) .cse4 v_ArrVal_9376) .cse5 v_ArrVal_9377) .cse6 v_ArrVal_9380) .cse7 v_ArrVal_9382) .cse8 v_ArrVal_9384) (select (select (store .cse9 .cse8 v_ArrVal_9383) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_9385))))))))))))))))))) 11) 0)))) is different from false [2025-03-04 14:45:33,720 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-04 14:45:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51167 treesize of output 14364