./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/uthash-2.0.2/uthash_OAT_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:58:26,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:58:26,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:58:26,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:58:26,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:58:26,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:58:26,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:58:26,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:58:26,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:58:26,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:58:26,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:58:26,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:58:26,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:58:26,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:58:26,284 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:58:26,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:58:26,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:58:26,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:58:26,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:58:26,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:58:26,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:58:26,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:58:26,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:58:26,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:58:26,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:58:26,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:58:26,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:58:26,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:58:26,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:58:26,288 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2025-03-04 14:58:26,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:58:26,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:58:26,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:58:26,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:58:26,536 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:58:26,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2025-03-04 14:58:27,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90967487d/a754d398514e423d90d286bc86132053/FLAG055ebd1de [2025-03-04 14:58:27,941 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:58:27,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2025-03-04 14:58:27,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90967487d/a754d398514e423d90d286bc86132053/FLAG055ebd1de [2025-03-04 14:58:27,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90967487d/a754d398514e423d90d286bc86132053 [2025-03-04 14:58:27,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:58:27,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:58:27,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:58:27,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:58:27,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:58:27,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:27" (1/1) ... [2025-03-04 14:58:27,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e16a5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:27, skipping insertion in model container [2025-03-04 14:58:27,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:27" (1/1) ... [2025-03-04 14:58:28,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:58:28,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:58:28,444 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:58:28,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:58:28,572 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:58:28,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28 WrapperNode [2025-03-04 14:58:28,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:58:28,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:58:28,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:58:28,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:58:28,582 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:58:28" (1/1) ... [2025-03-04 14:58:28,609 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:58:28" (1/1) ... [2025-03-04 14:58:28,672 INFO L138 Inliner]: procedures = 177, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2288 [2025-03-04 14:58:28,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:58:28,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:58:28,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:58:28,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:58:28,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,830 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [417, 2, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 99 writes are split as follows [98, 0, 1]. [2025-03-04 14:58:28,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:58:28,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:58:28,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:58:28,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:58:28,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (1/1) ... [2025-03-04 14:58:28,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:58:28,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:28,938 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:58:28,943 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:58:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:58:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:58:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:58:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:58:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:58:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:58:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:58:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:58:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:58:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:58:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:58:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:58:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:58:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:58:28,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:58:29,168 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:58:29,170 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:58:30,689 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-04 14:58:30,817 INFO L? ?]: Removed 533 outVars from TransFormulas that were not future-live. [2025-03-04 14:58:30,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:58:30,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:58:30,875 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 14:58:30,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:30 BoogieIcfgContainer [2025-03-04 14:58:30,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:58:30,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:58:30,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:58:30,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:58:30,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:58:27" (1/3) ... [2025-03-04 14:58:30,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339301f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:30, skipping insertion in model container [2025-03-04 14:58:30,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:28" (2/3) ... [2025-03-04 14:58:30,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339301f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:30, skipping insertion in model container [2025-03-04 14:58:30,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:30" (3/3) ... [2025-03-04 14:58:30,884 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-3.i [2025-03-04 14:58:30,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:58:30,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-3.i that has 6 procedures, 647 locations, 1 initial locations, 55 loop locations, and 10 error locations. [2025-03-04 14:58:30,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:58:30,954 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;@7ae69f82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:58:30,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 14:58:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 639 states, 612 states have (on average 1.6290849673202614) internal successors, (997), 629 states have internal predecessors, (997), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 14:58:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:58:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:30,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:58:30,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:30,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1072902957, now seen corresponding path program 1 times [2025-03-04 14:58:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929059192] [2025-03-04 14:58:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:31,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:58:31,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:58:31,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:31,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:31,079 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:58:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929059192] [2025-03-04 14:58:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929059192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:58:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175299519] [2025-03-04 14:58:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:31,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:58:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:31,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:58:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:58:31,102 INFO L87 Difference]: Start difference. First operand has 639 states, 612 states have (on average 1.6290849673202614) internal successors, (997), 629 states have internal predecessors, (997), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:58:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:31,258 INFO L93 Difference]: Finished difference Result 1272 states and 2048 transitions. [2025-03-04 14:58:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:58:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 14:58:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:31,271 INFO L225 Difference]: With dead ends: 1272 [2025-03-04 14:58:31,273 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 14:58:31,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:58:31,281 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:31,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 14:58:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-04 14:58:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 548 states have (on average 1.4708029197080292) internal successors, (806), 560 states have internal predecessors, (806), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 14:58:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 828 transitions. [2025-03-04 14:58:31,341 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 828 transitions. Word has length 5 [2025-03-04 14:58:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 828 transitions. [2025-03-04 14:58:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:58:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 828 transitions. [2025-03-04 14:58:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 14:58:31,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:31,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 14:58:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:58:31,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1099746306, now seen corresponding path program 1 times [2025-03-04 14:58:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143194110] [2025-03-04 14:58:31,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 14:58:31,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 14:58:31,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:31,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:31,425 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:58:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143194110] [2025-03-04 14:58:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143194110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:31,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005601094] [2025-03-04 14:58:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:31,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:31,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:31,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:31,428 INFO L87 Difference]: Start difference. First operand 569 states and 828 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:58:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:31,676 INFO L93 Difference]: Finished difference Result 1299 states and 1905 transitions. [2025-03-04 14:58:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-04 14:58:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:31,684 INFO L225 Difference]: With dead ends: 1299 [2025-03-04 14:58:31,686 INFO L226 Difference]: Without dead ends: 1120 [2025-03-04 14:58:31,686 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:58:31,687 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 786 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:31,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1545 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-03-04 14:58:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 743. [2025-03-04 14:58:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4741980474198046) internal successors, (1057), 734 states have internal predecessors, (1057), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:58:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1089 transitions. [2025-03-04 14:58:31,734 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1089 transitions. Word has length 6 [2025-03-04 14:58:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:31,734 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1089 transitions. [2025-03-04 14:58:31,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:58:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1089 transitions. [2025-03-04 14:58:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:58:31,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:31,739 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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:58:31,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:58:31,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:31,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1921936549, now seen corresponding path program 1 times [2025-03-04 14:58:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381939927] [2025-03-04 14:58:31,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:31,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:58:31,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:58:31,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:31,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:32,264 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:58:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381939927] [2025-03-04 14:58:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381939927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:58:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364755468] [2025-03-04 14:58:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:32,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:58:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:32,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:58:32,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:32,266 INFO L87 Difference]: Start difference. First operand 743 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:58:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:32,507 INFO L93 Difference]: Finished difference Result 1482 states and 2174 transitions. [2025-03-04 14:58:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 147 [2025-03-04 14:58:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:32,510 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 14:58:32,511 INFO L226 Difference]: Without dead ends: 746 [2025-03-04 14:58:32,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:32,512 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 87 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:32,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2856 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-04 14:58:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 743. [2025-03-04 14:58:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 717 states have (on average 1.4644351464435146) internal successors, (1050), 734 states have internal predecessors, (1050), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:58:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1082 transitions. [2025-03-04 14:58:32,535 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1082 transitions. Word has length 147 [2025-03-04 14:58:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:32,535 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1082 transitions. [2025-03-04 14:58:32,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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:58:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1082 transitions. [2025-03-04 14:58:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 14:58:32,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:32,540 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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:58:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:58:32,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -210256223, now seen corresponding path program 1 times [2025-03-04 14:58:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492750193] [2025-03-04 14:58:32,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:32,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 14:58:32,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 14:58:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:32,757 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:58:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492750193] [2025-03-04 14:58:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492750193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710081481] [2025-03-04 14:58:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:32,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:32,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:32,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:32,760 INFO L87 Difference]: Start difference. First operand 743 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:58:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:32,916 INFO L93 Difference]: Finished difference Result 1604 states and 2342 transitions. [2025-03-04 14:58:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-03-04 14:58:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:32,920 INFO L225 Difference]: With dead ends: 1604 [2025-03-04 14:58:32,920 INFO L226 Difference]: Without dead ends: 868 [2025-03-04 14:58:32,921 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:58:32,921 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 134 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:32,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1507 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-04 14:58:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2025-03-04 14:58:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 842 states have (on average 1.4655581947743468) internal successors, (1234), 859 states have internal predecessors, (1234), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:58:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1266 transitions. [2025-03-04 14:58:32,947 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1266 transitions. Word has length 147 [2025-03-04 14:58:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:32,948 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1266 transitions. [2025-03-04 14:58:32,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:58:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1266 transitions. [2025-03-04 14:58:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:32,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:32,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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:58:32,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:58:32,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:32,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1345241729, now seen corresponding path program 1 times [2025-03-04 14:58:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898392088] [2025-03-04 14:58:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:33,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:33,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:58:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898392088] [2025-03-04 14:58:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898392088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:58:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872024151] [2025-03-04 14:58:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:33,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:33,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:33,292 INFO L87 Difference]: Start difference. First operand 868 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:58:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:33,459 INFO L93 Difference]: Finished difference Result 1562 states and 2275 transitions. [2025-03-04 14:58:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:58:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:33,465 INFO L225 Difference]: With dead ends: 1562 [2025-03-04 14:58:33,465 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 14:58:33,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:58:33,468 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 30 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:33,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1977 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 14:58:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2025-03-04 14:58:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 800 states have (on average 1.44625) internal successors, (1157), 817 states have internal predecessors, (1157), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:58:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1189 transitions. [2025-03-04 14:58:33,492 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1189 transitions. Word has length 162 [2025-03-04 14:58:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:33,493 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1189 transitions. [2025-03-04 14:58:33,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:58:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1189 transitions. [2025-03-04 14:58:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:33,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:33,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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:58:33,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:58:33,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 928879033, now seen corresponding path program 1 times [2025-03-04 14:58:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829945955] [2025-03-04 14:58:33,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:33,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:33,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:33,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:33,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:58:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829945955] [2025-03-04 14:58:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829945955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:33,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:33,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530908727] [2025-03-04 14:58:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:33,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:33,740 INFO L87 Difference]: Start difference. First operand 826 states and 1189 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:33,862 INFO L93 Difference]: Finished difference Result 1520 states and 2187 transitions. [2025-03-04 14:58:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:33,867 INFO L225 Difference]: With dead ends: 1520 [2025-03-04 14:58:33,867 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 14:58:33,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:33,870 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:33,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1334 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 14:58:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2025-03-04 14:58:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 800 states have (on average 1.4425) internal successors, (1154), 817 states have internal predecessors, (1154), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:58:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1186 transitions. [2025-03-04 14:58:33,890 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1186 transitions. Word has length 162 [2025-03-04 14:58:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:33,891 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1186 transitions. [2025-03-04 14:58:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1186 transitions. [2025-03-04 14:58:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 14:58:33,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:33,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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:58:33,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:58:33,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:33,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:33,893 INFO L85 PathProgramCache]: Analyzing trace with hash 199838139, now seen corresponding path program 1 times [2025-03-04 14:58:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:33,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831466677] [2025-03-04 14:58:33,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 14:58:33,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 14:58:33,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:33,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:58:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831466677] [2025-03-04 14:58:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831466677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477978288] [2025-03-04 14:58:34,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:34,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:58:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:34,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:58:34,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:58:34,118 INFO L87 Difference]: Start difference. First operand 826 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:34,292 INFO L93 Difference]: Finished difference Result 1836 states and 2635 transitions. [2025-03-04 14:58:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:58:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 162 [2025-03-04 14:58:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:34,298 INFO L225 Difference]: With dead ends: 1836 [2025-03-04 14:58:34,298 INFO L226 Difference]: Without dead ends: 1142 [2025-03-04 14:58:34,299 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:58:34,300 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 460 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:34,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1531 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-04 14:58:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1137. [2025-03-04 14:58:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1098 states have (on average 1.4389799635701275) internal successors, (1580), 1125 states have internal predecessors, (1580), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 14:58:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1638 transitions. [2025-03-04 14:58:34,332 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1638 transitions. Word has length 162 [2025-03-04 14:58:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:34,332 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1638 transitions. [2025-03-04 14:58:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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:58:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1638 transitions. [2025-03-04 14:58:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 14:58:34,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:34,334 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, 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, 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, 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:58:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:58:34,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:34,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash -351401234, now seen corresponding path program 1 times [2025-03-04 14:58:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791731035] [2025-03-04 14:58:34,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 14:58:34,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 14:58:34,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:34,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:34,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791731035] [2025-03-04 14:58:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791731035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:34,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:58:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299542242] [2025-03-04 14:58:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:34,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:34,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:34,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:34,620 INFO L87 Difference]: Start difference. First operand 1137 states and 1638 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:34,828 INFO L93 Difference]: Finished difference Result 1204 states and 1723 transitions. [2025-03-04 14:58:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-04 14:58:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:34,832 INFO L225 Difference]: With dead ends: 1204 [2025-03-04 14:58:34,833 INFO L226 Difference]: Without dead ends: 1202 [2025-03-04 14:58:34,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:58:34,833 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 538 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:34,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2085 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-03-04 14:58:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2025-03-04 14:58:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1158 states have (on average 1.430915371329879) internal successors, (1657), 1185 states have internal predecessors, (1657), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1721 transitions. [2025-03-04 14:58:34,870 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1721 transitions. Word has length 177 [2025-03-04 14:58:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:34,871 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1721 transitions. [2025-03-04 14:58:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1721 transitions. [2025-03-04 14:58:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 14:58:34,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:34,873 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:34,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:58:34,873 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -39363680, now seen corresponding path program 1 times [2025-03-04 14:58:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:34,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999527969] [2025-03-04 14:58:34,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:34,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:58:35,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:58:35,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:35,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999527969] [2025-03-04 14:58:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999527969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007441103] [2025-03-04 14:58:35,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:35,650 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:58:35,652 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:58:35,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 14:58:36,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 14:58:36,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:36,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:36,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 14:58:36,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:36,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:58:36,216 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 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 14:58:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:36,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007441103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 14:58:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126939644] [2025-03-04 14:58:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 14:58:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:36,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 14:58:36,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:58:36,909 INFO L87 Difference]: Start difference. First operand 1200 states and 1721 transitions. Second operand has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:38,869 INFO L93 Difference]: Finished difference Result 2365 states and 3384 transitions. [2025-03-04 14:58:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:58:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-04 14:58:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:38,874 INFO L225 Difference]: With dead ends: 2365 [2025-03-04 14:58:38,874 INFO L226 Difference]: Without dead ends: 1250 [2025-03-04 14:58:38,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-04 14:58:38,876 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 960 mSDsluCounter, 3912 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 4587 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:38,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 4587 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 14:58:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-04 14:58:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1225. [2025-03-04 14:58:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1183 states have (on average 1.4260355029585798) internal successors, (1687), 1210 states have internal predecessors, (1687), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1751 transitions. [2025-03-04 14:58:38,910 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1751 transitions. Word has length 183 [2025-03-04 14:58:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:38,910 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1751 transitions. [2025-03-04 14:58:38,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.833333333333334) internal successors, (166), 12 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1751 transitions. [2025-03-04 14:58:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 14:58:38,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:38,912 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:38,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:58:39,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:39,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:39,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1684560194, now seen corresponding path program 1 times [2025-03-04 14:58:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016117232] [2025-03-04 14:58:39,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:58:39,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:58:39,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:39,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016117232] [2025-03-04 14:58:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016117232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600590444] [2025-03-04 14:58:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:39,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:39,811 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:58:39,813 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:58:40,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 14:58:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 14:58:40,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:40,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:40,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 14:58:40,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:40,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600590444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 14:58:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214142465] [2025-03-04 14:58:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:40,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:40,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:40,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:40,360 INFO L87 Difference]: Start difference. First operand 1225 states and 1751 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:40,609 INFO L93 Difference]: Finished difference Result 2383 states and 3411 transitions. [2025-03-04 14:58:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:40,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-04 14:58:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:40,614 INFO L225 Difference]: With dead ends: 2383 [2025-03-04 14:58:40,615 INFO L226 Difference]: Without dead ends: 1268 [2025-03-04 14:58:40,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:40,617 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 17 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:40,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1862 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-04 14:58:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1252. [2025-03-04 14:58:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1210 states have (on average 1.421487603305785) internal successors, (1720), 1237 states have internal predecessors, (1720), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1784 transitions. [2025-03-04 14:58:40,643 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1784 transitions. Word has length 184 [2025-03-04 14:58:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:40,643 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1784 transitions. [2025-03-04 14:58:40,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1784 transitions. [2025-03-04 14:58:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 14:58:40,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:40,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:40,655 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:58:40,849 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,SelfDestructingSolverStorable9 [2025-03-04 14:58:40,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -469055491, now seen corresponding path program 1 times [2025-03-04 14:58:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084136111] [2025-03-04 14:58:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:40,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 14:58:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 14:58:40,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:40,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:41,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084136111] [2025-03-04 14:58:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084136111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:41,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:58:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263623219] [2025-03-04 14:58:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:41,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:58:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:41,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:58:41,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:41,195 INFO L87 Difference]: Start difference. First operand 1252 states and 1784 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:41,574 INFO L93 Difference]: Finished difference Result 2402 states and 3430 transitions. [2025-03-04 14:58:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:58:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-04 14:58:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:41,580 INFO L225 Difference]: With dead ends: 2402 [2025-03-04 14:58:41,580 INFO L226 Difference]: Without dead ends: 1264 [2025-03-04 14:58:41,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:58:41,582 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:41,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2374 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:58:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-03-04 14:58:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1260. [2025-03-04 14:58:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1218 states have (on average 1.4203612479474548) internal successors, (1730), 1245 states have internal predecessors, (1730), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1794 transitions. [2025-03-04 14:58:41,609 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1794 transitions. Word has length 185 [2025-03-04 14:58:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:41,610 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1794 transitions. [2025-03-04 14:58:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1794 transitions. [2025-03-04 14:58:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:58:41,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:41,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:58:41,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1078862686, now seen corresponding path program 1 times [2025-03-04 14:58:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907580354] [2025-03-04 14:58:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:41,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:41,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:41,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:41,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907580354] [2025-03-04 14:58:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907580354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:41,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:41,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:58:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767765224] [2025-03-04 14:58:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:58:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:41,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:58:41,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:41,952 INFO L87 Difference]: Start difference. First operand 1260 states and 1794 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:42,492 INFO L93 Difference]: Finished difference Result 2417 states and 3450 transitions. [2025-03-04 14:58:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:42,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-04 14:58:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:42,497 INFO L225 Difference]: With dead ends: 2417 [2025-03-04 14:58:42,497 INFO L226 Difference]: Without dead ends: 1282 [2025-03-04 14:58:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:42,499 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 12 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3455 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:58:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-03-04 14:58:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1276. [2025-03-04 14:58:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1234 states have (on average 1.4197730956239871) internal successors, (1752), 1261 states have internal predecessors, (1752), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1816 transitions. [2025-03-04 14:58:42,520 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1816 transitions. Word has length 186 [2025-03-04 14:58:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1816 transitions. [2025-03-04 14:58:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1816 transitions. [2025-03-04 14:58:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 14:58:42,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:42,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:58:42,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1920240323, now seen corresponding path program 1 times [2025-03-04 14:58:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452163062] [2025-03-04 14:58:42,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:42,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:42,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:42,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:42,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452163062] [2025-03-04 14:58:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452163062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517532141] [2025-03-04 14:58:43,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:43,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:43,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:43,098 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:58:43,099 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:58:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 14:58:43,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 14:58:43,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:43,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:43,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:58:43,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:43,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517532141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 14:58:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95812542] [2025-03-04 14:58:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:58:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:43,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:58:43,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:43,840 INFO L87 Difference]: Start difference. First operand 1276 states and 1816 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:44,392 INFO L93 Difference]: Finished difference Result 2433 states and 3471 transitions. [2025-03-04 14:58:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-04 14:58:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:44,397 INFO L225 Difference]: With dead ends: 2433 [2025-03-04 14:58:44,397 INFO L226 Difference]: Without dead ends: 1290 [2025-03-04 14:58:44,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:44,399 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 12 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:44,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3461 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:58:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-04 14:58:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1276. [2025-03-04 14:58:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1234 states have (on average 1.4197730956239871) internal successors, (1752), 1261 states have internal predecessors, (1752), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1816 transitions. [2025-03-04 14:58:44,422 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1816 transitions. Word has length 186 [2025-03-04 14:58:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:44,422 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1816 transitions. [2025-03-04 14:58:44,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1816 transitions. [2025-03-04 14:58:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 14:58:44,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:44,423 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:44,435 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:58:44,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:44,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:44,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash -893337290, now seen corresponding path program 1 times [2025-03-04 14:58:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796280429] [2025-03-04 14:58:44,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:44,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 14:58:44,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 14:58:44,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:44,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796280429] [2025-03-04 14:58:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796280429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 14:58:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154045412] [2025-03-04 14:58:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:58:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:44,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:58:44,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:44,981 INFO L87 Difference]: Start difference. First operand 1276 states and 1816 transitions. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:45,537 INFO L93 Difference]: Finished difference Result 2440 states and 3477 transitions. [2025-03-04 14:58:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:58:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-04 14:58:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:45,542 INFO L225 Difference]: With dead ends: 2440 [2025-03-04 14:58:45,542 INFO L226 Difference]: Without dead ends: 1302 [2025-03-04 14:58:45,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:45,544 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 20 mSDsluCounter, 4013 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:45,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4680 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:58:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-03-04 14:58:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1290. [2025-03-04 14:58:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1248 states have (on average 1.4182692307692308) internal successors, (1770), 1275 states have internal predecessors, (1770), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1834 transitions. [2025-03-04 14:58:45,567 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1834 transitions. Word has length 187 [2025-03-04 14:58:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:45,567 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1834 transitions. [2025-03-04 14:58:45,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1834 transitions. [2025-03-04 14:58:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 14:58:45,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:45,569 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 14:58:45,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 623749943, now seen corresponding path program 1 times [2025-03-04 14:58:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004762751] [2025-03-04 14:58:45,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:45,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 14:58:45,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 14:58:45,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:45,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004762751] [2025-03-04 14:58:45,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004762751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:45,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783950331] [2025-03-04 14:58:45,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:45,937 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:58:45,938 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:58:46,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 14:58:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 14:58:46,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:46,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 14:58:46,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:46,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783950331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:46,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-04 14:58:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886773549] [2025-03-04 14:58:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:58:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:46,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:58:46,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:58:46,528 INFO L87 Difference]: Start difference. First operand 1290 states and 1834 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:47,134 INFO L93 Difference]: Finished difference Result 2461 states and 3504 transitions. [2025-03-04 14:58:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:58:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-04 14:58:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:47,139 INFO L225 Difference]: With dead ends: 2461 [2025-03-04 14:58:47,139 INFO L226 Difference]: Without dead ends: 1316 [2025-03-04 14:58:47,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:58:47,142 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 17 mSDsluCounter, 2849 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:47,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3524 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:58:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2025-03-04 14:58:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1300. [2025-03-04 14:58:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1258 states have (on average 1.4165341812400636) internal successors, (1782), 1285 states have internal predecessors, (1782), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1846 transitions. [2025-03-04 14:58:47,163 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1846 transitions. Word has length 187 [2025-03-04 14:58:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:47,163 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1846 transitions. [2025-03-04 14:58:47,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1846 transitions. [2025-03-04 14:58:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 14:58:47,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:47,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:47,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:58:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:58:47,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 472833463, now seen corresponding path program 1 times [2025-03-04 14:58:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131444264] [2025-03-04 14:58:47,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:47,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 14:58:47,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 14:58:47,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131444264] [2025-03-04 14:58:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131444264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 14:58:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028108831] [2025-03-04 14:58:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:58:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:47,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:58:47,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:58:47,763 INFO L87 Difference]: Start difference. First operand 1300 states and 1846 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:48,449 INFO L93 Difference]: Finished difference Result 2473 states and 3520 transitions. [2025-03-04 14:58:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:58:48,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-03-04 14:58:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:48,454 INFO L225 Difference]: With dead ends: 2473 [2025-03-04 14:58:48,454 INFO L226 Difference]: Without dead ends: 1318 [2025-03-04 14:58:48,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:58:48,455 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 26 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4632 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:48,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4632 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:58:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-04 14:58:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1306. [2025-03-04 14:58:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1264 states have (on average 1.4145569620253164) internal successors, (1788), 1291 states have internal predecessors, (1788), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 14:58:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1852 transitions. [2025-03-04 14:58:48,478 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1852 transitions. Word has length 188 [2025-03-04 14:58:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:48,478 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1852 transitions. [2025-03-04 14:58:48,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1852 transitions. [2025-03-04 14:58:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 14:58:48,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:48,480 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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, 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:58:48,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:58:48,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:48,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1717719878, now seen corresponding path program 1 times [2025-03-04 14:58:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397589270] [2025-03-04 14:58:48,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 14:58:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 14:58:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:58:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397589270] [2025-03-04 14:58:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397589270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347373284] [2025-03-04 14:58:48,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:48,892 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:58:48,898 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:58:49,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 14:58:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 14:58:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:49,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 14:58:49,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:58:49,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:58:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347373284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:49,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:58:49,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 14:58:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054074308] [2025-03-04 14:58:49,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:49,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:58:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:49,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:58:49,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:49,485 INFO L87 Difference]: Start difference. First operand 1306 states and 1852 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:58:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:49,588 INFO L93 Difference]: Finished difference Result 2427 states and 3459 transitions. [2025-03-04 14:58:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:58:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-03-04 14:58:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:49,593 INFO L225 Difference]: With dead ends: 2427 [2025-03-04 14:58:49,593 INFO L226 Difference]: Without dead ends: 1309 [2025-03-04 14:58:49,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:58:49,595 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:49,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2033 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:58:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-03-04 14:58:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2025-03-04 14:58:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1266 states have (on average 1.414691943127962) internal successors, (1791), 1294 states have internal predecessors, (1791), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:58:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1859 transitions. [2025-03-04 14:58:49,617 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1859 transitions. Word has length 188 [2025-03-04 14:58:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:49,618 INFO L471 AbstractCegarLoop]: Abstraction has 1309 states and 1859 transitions. [2025-03-04 14:58:49,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:58:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1859 transitions. [2025-03-04 14:58:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 14:58:49,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:49,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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, 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, 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:58:49,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:58:49,820 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,SelfDestructingSolverStorable16 [2025-03-04 14:58:49,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 883578882, now seen corresponding path program 1 times [2025-03-04 14:58:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048750171] [2025-03-04 14:58:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:49,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 14:58:50,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 14:58:50,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:50,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:58:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048750171] [2025-03-04 14:58:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048750171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164209137] [2025-03-04 14:58:50,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:50,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:50,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:50,356 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:58:50,359 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:58:50,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 14:58:50,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 14:58:50,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:50,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:51,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 14:58:51,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 14:58:51,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:58:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 14:58:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164209137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:58:51,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:58:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 14:58:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454422537] [2025-03-04 14:58:51,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:58:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:58:51,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:51,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:58:51,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:58:51,096 INFO L87 Difference]: Start difference. First operand 1309 states and 1859 transitions. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:58:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:51,336 INFO L93 Difference]: Finished difference Result 2441 states and 3489 transitions. [2025-03-04 14:58:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:58:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 192 [2025-03-04 14:58:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:51,340 INFO L225 Difference]: With dead ends: 2441 [2025-03-04 14:58:51,340 INFO L226 Difference]: Without dead ends: 1320 [2025-03-04 14:58:51,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:58:51,342 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 5 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4048 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4048 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:58:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-04 14:58:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1318. [2025-03-04 14:58:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1274 states have (on average 1.4167974882260597) internal successors, (1805), 1302 states have internal predecessors, (1805), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:58:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1873 transitions. [2025-03-04 14:58:51,362 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1873 transitions. Word has length 192 [2025-03-04 14:58:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:51,362 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1873 transitions. [2025-03-04 14:58:51,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 14:58:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1873 transitions. [2025-03-04 14:58:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 14:58:51,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:51,364 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 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, 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, 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, 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:58:51,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:58:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 14:58:51,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:51,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 468656442, now seen corresponding path program 2 times [2025-03-04 14:58:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151509186] [2025-03-04 14:58:51,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:58:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:51,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 14:58:51,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 14:58:51,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:58:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 14:58:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151509186] [2025-03-04 14:58:52,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151509186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963772066] [2025-03-04 14:58:52,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:58:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:58:52,270 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:58:52,271 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:58:52,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 14:58:52,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 14:58:52,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:58:52,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:52,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 14:58:52,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:58:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 14:58:53,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:58:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 70 refuted. 1 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 14:58:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963772066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:58:57,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:58:57,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-03-04 14:58:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953329967] [2025-03-04 14:58:57,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:58:57,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 14:58:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:57,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 14:58:57,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=271, Unknown=1, NotChecked=0, Total=380 [2025-03-04 14:58:57,218 INFO L87 Difference]: Start difference. First operand 1318 states and 1873 transitions. Second operand has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:58:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:57,858 INFO L93 Difference]: Finished difference Result 2435 states and 3491 transitions. [2025-03-04 14:58:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 14:58:57,858 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 200 [2025-03-04 14:58:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:57,862 INFO L225 Difference]: With dead ends: 2435 [2025-03-04 14:58:57,862 INFO L226 Difference]: Without dead ends: 1173 [2025-03-04 14:58:57,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=256, Invalid=555, Unknown=1, NotChecked=0, Total=812 [2025-03-04 14:58:57,864 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 30 mSDsluCounter, 5952 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6554 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:57,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6554 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:58:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-04 14:58:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1169. [2025-03-04 14:58:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1125 states have (on average 1.4044444444444444) internal successors, (1580), 1153 states have internal predecessors, (1580), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:58:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1648 transitions. [2025-03-04 14:58:57,882 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1648 transitions. Word has length 200 [2025-03-04 14:58:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:57,882 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1648 transitions. [2025-03-04 14:58:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 14:58:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1648 transitions. [2025-03-04 14:58:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 14:58:57,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:57,885 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:58:57,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:58:58,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:58,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2023388064, now seen corresponding path program 3 times [2025-03-04 14:58:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032946598] [2025-03-04 14:58:58,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:58:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:58,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 218 statements into 18 equivalence classes. [2025-03-04 14:58:58,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 97 of 218 statements. [2025-03-04 14:58:58,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 14:58:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-04 14:58:58,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:58,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032946598] [2025-03-04 14:58:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032946598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:58:58,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:58:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:58:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788882455] [2025-03-04 14:58:58,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:58:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:58:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:58:58,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:58:58,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:58,396 INFO L87 Difference]: Start difference. First operand 1169 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:58:58,724 INFO L93 Difference]: Finished difference Result 2277 states and 3225 transitions. [2025-03-04 14:58:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:58:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 218 [2025-03-04 14:58:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:58:58,728 INFO L225 Difference]: With dead ends: 2277 [2025-03-04 14:58:58,728 INFO L226 Difference]: Without dead ends: 1175 [2025-03-04 14:58:58,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:58:58,730 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 8 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:58:58,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3298 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:58:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-04 14:58:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2025-03-04 14:58:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1131 states have (on average 1.4022988505747127) internal successors, (1586), 1159 states have internal predecessors, (1586), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:58:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1654 transitions. [2025-03-04 14:58:58,748 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1654 transitions. Word has length 218 [2025-03-04 14:58:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:58:58,748 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1654 transitions. [2025-03-04 14:58:58,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:58:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1654 transitions. [2025-03-04 14:58:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 14:58:58,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:58:58,749 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:58:58,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:58:58,749 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:58:58,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:58:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1825944292, now seen corresponding path program 1 times [2025-03-04 14:58:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:58:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496469544] [2025-03-04 14:58:58,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:58:58,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 14:58:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 14:58:59,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:58:59,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:58:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 14:58:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:58:59,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496469544] [2025-03-04 14:58:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496469544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:58:59,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292550434] [2025-03-04 14:58:59,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:58:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:58:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:00,000 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:59:00,001 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:59:00,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 14:59:00,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 14:59:00,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:00,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:00,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 14:59:00,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:59:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-04 14:59:00,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:59:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292550434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:59:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-03-04 14:59:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246238440] [2025-03-04 14:59:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:59:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:00,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:59:00,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-04 14:59:00,783 INFO L87 Difference]: Start difference. First operand 1175 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:59:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:01,096 INFO L93 Difference]: Finished difference Result 2287 states and 3233 transitions. [2025-03-04 14:59:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:59:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 218 [2025-03-04 14:59:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:01,101 INFO L225 Difference]: With dead ends: 2287 [2025-03-04 14:59:01,101 INFO L226 Difference]: Without dead ends: 1189 [2025-03-04 14:59:01,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:59:01,103 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 39 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:01,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3320 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:59:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-03-04 14:59:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1169. [2025-03-04 14:59:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1125 states have (on average 1.4026666666666667) internal successors, (1578), 1153 states have internal predecessors, (1578), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:59:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1646 transitions. [2025-03-04 14:59:01,127 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1646 transitions. Word has length 218 [2025-03-04 14:59:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1646 transitions. [2025-03-04 14:59:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 14:59:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1646 transitions. [2025-03-04 14:59:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 14:59:01,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:01,129 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:59:01,141 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:59:01,329 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,SelfDestructingSolverStorable20 [2025-03-04 14:59:01,329 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:59:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1081522812, now seen corresponding path program 1 times [2025-03-04 14:59:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402620757] [2025-03-04 14:59:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:01,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 14:59:02,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 14:59:02,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 14:59:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402620757] [2025-03-04 14:59:02,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402620757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:59:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931641161] [2025-03-04 14:59:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:02,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:02,486 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:59:02,488 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:59:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 14:59:03,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 14:59:03,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:03,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:03,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 14:59:03,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:59:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-04 14:59:03,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:59:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931641161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:59:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2025-03-04 14:59:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828800511] [2025-03-04 14:59:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:03,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:59:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:03,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:59:03,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:59:03,373 INFO L87 Difference]: Start difference. First operand 1169 states and 1646 transitions. Second operand has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:03,619 INFO L93 Difference]: Finished difference Result 2158 states and 3067 transitions. [2025-03-04 14:59:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:59:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 218 [2025-03-04 14:59:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:03,624 INFO L225 Difference]: With dead ends: 2158 [2025-03-04 14:59:03,624 INFO L226 Difference]: Without dead ends: 1191 [2025-03-04 14:59:03,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:59:03,626 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 30 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:03,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2857 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:59:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-03-04 14:59:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1183. [2025-03-04 14:59:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1139 states have (on average 1.3994732221246708) internal successors, (1594), 1167 states have internal predecessors, (1594), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:59:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1662 transitions. [2025-03-04 14:59:03,643 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1662 transitions. Word has length 218 [2025-03-04 14:59:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1662 transitions. [2025-03-04 14:59:03,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.555555555555557) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1662 transitions. [2025-03-04 14:59:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-04 14:59:03,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:03,644 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:59:03,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:59:03,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:03,845 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:59:03,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:03,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1106265421, now seen corresponding path program 1 times [2025-03-04 14:59:03,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:03,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667831282] [2025-03-04 14:59:03,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-04 14:59:03,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-04 14:59:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-04 14:59:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667831282] [2025-03-04 14:59:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667831282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:59:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465957840] [2025-03-04 14:59:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:59:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:04,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:59:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:59:04,280 INFO L87 Difference]: Start difference. First operand 1183 states and 1662 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:04,594 INFO L93 Difference]: Finished difference Result 2152 states and 3050 transitions. [2025-03-04 14:59:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:59:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 219 [2025-03-04 14:59:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:04,598 INFO L225 Difference]: With dead ends: 2152 [2025-03-04 14:59:04,598 INFO L226 Difference]: Without dead ends: 1179 [2025-03-04 14:59:04,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:59:04,599 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 13 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:04,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2753 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:59:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-03-04 14:59:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2025-03-04 14:59:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1133 states have (on average 1.3980582524271845) internal successors, (1584), 1161 states have internal predecessors, (1584), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:59:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1652 transitions. [2025-03-04 14:59:04,619 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1652 transitions. Word has length 219 [2025-03-04 14:59:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1652 transitions. [2025-03-04 14:59:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1652 transitions. [2025-03-04 14:59:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 14:59:04,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:04,620 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:59:04,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:59:04,620 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:59:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash -886211425, now seen corresponding path program 1 times [2025-03-04 14:59:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715196263] [2025-03-04 14:59:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-04 14:59:04,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 14:59:04,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:04,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-04 14:59:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:04,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715196263] [2025-03-04 14:59:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715196263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:59:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288953114] [2025-03-04 14:59:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:59:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:04,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:59:04,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:59:04,971 INFO L87 Difference]: Start difference. First operand 1177 states and 1652 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:05,206 INFO L93 Difference]: Finished difference Result 2151 states and 3047 transitions. [2025-03-04 14:59:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:59:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 220 [2025-03-04 14:59:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:05,210 INFO L225 Difference]: With dead ends: 2151 [2025-03-04 14:59:05,210 INFO L226 Difference]: Without dead ends: 1183 [2025-03-04 14:59:05,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:59:05,211 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 8 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:05,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2771 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:59:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-04 14:59:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2025-03-04 14:59:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1139 states have (on average 1.3959613696224757) internal successors, (1590), 1167 states have internal predecessors, (1590), 32 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-04 14:59:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1658 transitions. [2025-03-04 14:59:05,227 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1658 transitions. Word has length 220 [2025-03-04 14:59:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:05,227 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1658 transitions. [2025-03-04 14:59:05,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:59:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1658 transitions. [2025-03-04 14:59:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 14:59:05,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:05,228 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 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, 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, 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:59:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 14:59:05,228 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 14:59:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2024887550, now seen corresponding path program 1 times [2025-03-04 14:59:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146600015] [2025-03-04 14:59:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:05,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 14:59:05,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 14:59:05,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:05,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 5 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 14:59:06,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146600015] [2025-03-04 14:59:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146600015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:59:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648896631] [2025-03-04 14:59:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:06,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:06,121 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:59:06,122 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:59:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 14:59:07,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 14:59:07,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:07,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:07,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 199 conjuncts are in the unsatisfiable core [2025-03-04 14:59:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:59:07,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 14:59:07,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:59:07,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-03-04 14:59:07,718 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 30 treesize of output 11 [2025-03-04 14:59:07,734 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 23 treesize of output 11 [2025-03-04 14:59:07,751 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 14:59:07,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 14:59:07,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 14:59:07,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 14:59:07,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-04 14:59:07,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-04 14:59:07,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-04 14:59:08,129 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 14:59:08,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-03-04 14:59:08,133 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 24 treesize of output 11 [2025-03-04 14:59:08,138 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 24 treesize of output 11