./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --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/systemc/pc_sfifo_3.cil.c -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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:34:20,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:34:20,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:34:20,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:34:20,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:34:20,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:34:20,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:34:20,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:34:20,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:34:20,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:34:20,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:34:20,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:34:20,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:34:20,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:34:20,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:20,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:34:20,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:34:20,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:34:20,116 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2025-03-04 11:34:20,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:34:20,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:34:20,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:34:20,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:34:20,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:34:20,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-03-04 11:34:21,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87e79fb3/3f4e4889c5bd412e8a6d7c1a2fcac3c2/FLAG5f49c53e7 [2025-03-04 11:34:21,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:34:21,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2025-03-04 11:34:21,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87e79fb3/3f4e4889c5bd412e8a6d7c1a2fcac3c2/FLAG5f49c53e7 [2025-03-04 11:34:22,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87e79fb3/3f4e4889c5bd412e8a6d7c1a2fcac3c2 [2025-03-04 11:34:22,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:34:22,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:34:22,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:22,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:34:22,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:34:22,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4995a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22, skipping insertion in model container [2025-03-04 11:34:22,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:34:22,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:22,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:34:22,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:22,229 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:34:22,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22 WrapperNode [2025-03-04 11:34:22,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:22,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:22,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:34:22,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:34:22,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,260 INFO L138 Inliner]: procedures = 31, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 226 [2025-03-04 11:34:22,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:22,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:34:22,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:34:22,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:34:22,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,287 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:34:22,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:34:22,298 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:34:22,298 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:34:22,298 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:34:22,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (1/1) ... [2025-03-04 11:34:22,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:22,326 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 11:34:22,328 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 11:34:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:34:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-04 11:34:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-04 11:34:22,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:34:22,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:34:22,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: do_read_c_~a~0#1 := ~a_t~0; [2025-03-04 11:34:22,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-04 11:34:22,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: assume !(1 == ~q_free~0); [2025-03-04 11:34:22,659 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-04 11:34:22,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:34:22,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:34:22,669 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:34:22,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:22 BoogieIcfgContainer [2025-03-04 11:34:22,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:34:22,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:34:22,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:34:22,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:34:22,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:34:22" (1/3) ... [2025-03-04 11:34:22,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dc84ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:22, skipping insertion in model container [2025-03-04 11:34:22,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:22" (2/3) ... [2025-03-04 11:34:22,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dc84ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:22, skipping insertion in model container [2025-03-04 11:34:22,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:22" (3/3) ... [2025-03-04 11:34:22,677 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2025-03-04 11:34:22,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:34:22,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil.c that has 9 procedures, 133 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-03-04 11:34:22,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:34:22,733 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;@60a03f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:34:22,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:34:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 111 states have internal predecessors, (152), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 11:34:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:34:22,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:22,743 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] [2025-03-04 11:34:22,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1172452567, now seen corresponding path program 1 times [2025-03-04 11:34:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397162338] [2025-03-04 11:34:22,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:34:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:34:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:23,065 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 11:34:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397162338] [2025-03-04 11:34:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397162338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:23,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054342819] [2025-03-04 11:34:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:23,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:23,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:23,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:23,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:23,086 INFO L87 Difference]: Start difference. First operand has 133 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 111 states have internal predecessors, (152), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:23,364 INFO L93 Difference]: Finished difference Result 390 states and 554 transitions. [2025-03-04 11:34:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2025-03-04 11:34:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:23,374 INFO L225 Difference]: With dead ends: 390 [2025-03-04 11:34:23,374 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 11:34:23,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:23,381 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:23,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 461 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 11:34:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 243. [2025-03-04 11:34:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 202 states have internal predecessors, (278), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2025-03-04 11:34:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 337 transitions. [2025-03-04 11:34:23,426 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 337 transitions. Word has length 61 [2025-03-04 11:34:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:23,426 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 337 transitions. [2025-03-04 11:34:23,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 337 transitions. [2025-03-04 11:34:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:34:23,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:23,428 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] [2025-03-04 11:34:23,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:34:23,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1076699081, now seen corresponding path program 1 times [2025-03-04 11:34:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245709850] [2025-03-04 11:34:23,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:34:23,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:34:23,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:23,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:23,573 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 11:34:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245709850] [2025-03-04 11:34:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245709850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:23,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232434131] [2025-03-04 11:34:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:23,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:23,577 INFO L87 Difference]: Start difference. First operand 243 states and 337 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:23,945 INFO L93 Difference]: Finished difference Result 638 states and 882 transitions. [2025-03-04 11:34:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2025-03-04 11:34:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:23,948 INFO L225 Difference]: With dead ends: 638 [2025-03-04 11:34:23,948 INFO L226 Difference]: Without dead ends: 411 [2025-03-04 11:34:23,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:23,950 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 264 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:23,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 840 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-04 11:34:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 363. [2025-03-04 11:34:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 292 states have (on average 1.4246575342465753) internal successors, (416), 302 states have internal predecessors, (416), 40 states have call successors, (40), 21 states have call predecessors, (40), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2025-03-04 11:34:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 509 transitions. [2025-03-04 11:34:23,993 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 509 transitions. Word has length 61 [2025-03-04 11:34:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:23,994 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 509 transitions. [2025-03-04 11:34:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 509 transitions. [2025-03-04 11:34:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:34:23,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:23,998 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] [2025-03-04 11:34:23,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:34:23,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:23,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2046280104, now seen corresponding path program 1 times [2025-03-04 11:34:24,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:24,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697612529] [2025-03-04 11:34:24,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:24,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:24,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:34:24,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:34:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:24,105 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 11:34:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697612529] [2025-03-04 11:34:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697612529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:34:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392072012] [2025-03-04 11:34:24,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:24,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:34:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:34:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:24,107 INFO L87 Difference]: Start difference. First operand 363 states and 509 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:34:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:24,923 INFO L93 Difference]: Finished difference Result 1941 states and 2739 transitions. [2025-03-04 11:34:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:34:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 61 [2025-03-04 11:34:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:24,932 INFO L225 Difference]: With dead ends: 1941 [2025-03-04 11:34:24,932 INFO L226 Difference]: Without dead ends: 1582 [2025-03-04 11:34:24,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:34:24,935 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1317 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:24,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1157 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:34:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-04 11:34:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1467. [2025-03-04 11:34:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1191 states have (on average 1.3761544920235096) internal successors, (1639), 1216 states have internal predecessors, (1639), 150 states have call successors, (150), 104 states have call predecessors, (150), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2025-03-04 11:34:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1975 transitions. [2025-03-04 11:34:25,063 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1975 transitions. Word has length 61 [2025-03-04 11:34:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:25,063 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 1975 transitions. [2025-03-04 11:34:25,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:34:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1975 transitions. [2025-03-04 11:34:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:34:25,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:25,065 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] [2025-03-04 11:34:25,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:34:25,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:25,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2056750112, now seen corresponding path program 1 times [2025-03-04 11:34:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:25,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583483072] [2025-03-04 11:34:25,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:25,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:34:25,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:34:25,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:25,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:25,135 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 11:34:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583483072] [2025-03-04 11:34:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583483072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154912844] [2025-03-04 11:34:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:25,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:25,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:25,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:25,137 INFO L87 Difference]: Start difference. First operand 1467 states and 1975 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:34:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:25,232 INFO L93 Difference]: Finished difference Result 2964 states and 4012 transitions. [2025-03-04 11:34:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-04 11:34:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:25,238 INFO L225 Difference]: With dead ends: 2964 [2025-03-04 11:34:25,238 INFO L226 Difference]: Without dead ends: 1507 [2025-03-04 11:34:25,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:34:25,242 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:25,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 814 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-03-04 11:34:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2025-03-04 11:34:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1223 states have (on average 1.3614063777596075) internal successors, (1665), 1248 states have internal predecessors, (1665), 150 states have call successors, (150), 104 states have call predecessors, (150), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2025-03-04 11:34:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2009 transitions. [2025-03-04 11:34:25,340 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2009 transitions. Word has length 63 [2025-03-04 11:34:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:25,341 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2009 transitions. [2025-03-04 11:34:25,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:34:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2009 transitions. [2025-03-04 11:34:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:34:25,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:25,342 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] [2025-03-04 11:34:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:34:25,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -287916929, now seen corresponding path program 1 times [2025-03-04 11:34:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800179922] [2025-03-04 11:34:25,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:25,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:34:25,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:34:25,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:25,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:25,429 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 11:34:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800179922] [2025-03-04 11:34:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800179922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:25,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:34:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841755114] [2025-03-04 11:34:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:25,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:34:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:25,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:34:25,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:25,430 INFO L87 Difference]: Start difference. First operand 1507 states and 2009 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 11:34:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:26,152 INFO L93 Difference]: Finished difference Result 5121 states and 6940 transitions. [2025-03-04 11:34:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:34:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-03-04 11:34:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:26,168 INFO L225 Difference]: With dead ends: 5121 [2025-03-04 11:34:26,168 INFO L226 Difference]: Without dead ends: 3624 [2025-03-04 11:34:26,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:34:26,174 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1370 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:26,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 1172 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:34:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2025-03-04 11:34:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3349. [2025-03-04 11:34:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 2704 states have (on average 1.3258136094674555) internal successors, (3585), 2750 states have internal predecessors, (3585), 345 states have call successors, (345), 245 states have call predecessors, (345), 294 states have return successors, (443), 355 states have call predecessors, (443), 345 states have call successors, (443) [2025-03-04 11:34:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4373 transitions. [2025-03-04 11:34:26,330 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4373 transitions. Word has length 63 [2025-03-04 11:34:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:26,330 INFO L471 AbstractCegarLoop]: Abstraction has 3349 states and 4373 transitions. [2025-03-04 11:34:26,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 11:34:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4373 transitions. [2025-03-04 11:34:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:34:26,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:26,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:34:26,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -370419714, now seen corresponding path program 1 times [2025-03-04 11:34:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744322970] [2025-03-04 11:34:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:26,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:34:26,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:34:26,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:26,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:34:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744322970] [2025-03-04 11:34:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744322970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:26,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:26,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927844881] [2025-03-04 11:34:26,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:26,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:26,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:26,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:26,386 INFO L87 Difference]: Start difference. First operand 3349 states and 4373 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:34:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:26,496 INFO L93 Difference]: Finished difference Result 6818 states and 8952 transitions. [2025-03-04 11:34:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-03-04 11:34:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:26,513 INFO L225 Difference]: With dead ends: 6818 [2025-03-04 11:34:26,513 INFO L226 Difference]: Without dead ends: 3479 [2025-03-04 11:34:26,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 11:34:26,520 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:26,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 814 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2025-03-04 11:34:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3479. [2025-03-04 11:34:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 2808 states have (on average 1.3116096866096867) internal successors, (3683), 2854 states have internal predecessors, (3683), 345 states have call successors, (345), 245 states have call predecessors, (345), 320 states have return successors, (469), 381 states have call predecessors, (469), 345 states have call successors, (469) [2025-03-04 11:34:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 4497 transitions. [2025-03-04 11:34:26,659 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 4497 transitions. Word has length 80 [2025-03-04 11:34:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 4497 transitions. [2025-03-04 11:34:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:34:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 4497 transitions. [2025-03-04 11:34:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:34:26,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:26,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:34:26,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -819116353, now seen corresponding path program 1 times [2025-03-04 11:34:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735488562] [2025-03-04 11:34:26,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:26,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:34:26,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:34:26,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:26,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:34:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735488562] [2025-03-04 11:34:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735488562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55528982] [2025-03-04 11:34:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:26,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:26,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:26,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:26,763 INFO L87 Difference]: Start difference. First operand 3479 states and 4497 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:27,175 INFO L93 Difference]: Finished difference Result 6687 states and 8612 transitions. [2025-03-04 11:34:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:34:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2025-03-04 11:34:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:27,189 INFO L225 Difference]: With dead ends: 6687 [2025-03-04 11:34:27,190 INFO L226 Difference]: Without dead ends: 3554 [2025-03-04 11:34:27,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:27,196 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 287 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:27,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 596 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2025-03-04 11:34:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3150. [2025-03-04 11:34:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2555 states have (on average 1.3103718199608612) internal successors, (3348), 2591 states have internal predecessors, (3348), 307 states have call successors, (307), 219 states have call predecessors, (307), 282 states have return successors, (408), 340 states have call predecessors, (408), 307 states have call successors, (408) [2025-03-04 11:34:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4063 transitions. [2025-03-04 11:34:27,358 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4063 transitions. Word has length 80 [2025-03-04 11:34:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:27,358 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 4063 transitions. [2025-03-04 11:34:27,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4063 transitions. [2025-03-04 11:34:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:34:27,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:27,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:27,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:34:27,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:27,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash 813687646, now seen corresponding path program 1 times [2025-03-04 11:34:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352262533] [2025-03-04 11:34:27,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:34:27,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:34:27,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:34:27,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352262533] [2025-03-04 11:34:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352262533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509906330] [2025-03-04 11:34:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:27,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:27,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:27,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:27,398 INFO L87 Difference]: Start difference. First operand 3150 states and 4063 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:34:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:27,699 INFO L93 Difference]: Finished difference Result 9239 states and 12106 transitions. [2025-03-04 11:34:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2025-03-04 11:34:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:27,721 INFO L225 Difference]: With dead ends: 9239 [2025-03-04 11:34:27,722 INFO L226 Difference]: Without dead ends: 6100 [2025-03-04 11:34:27,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 11:34:27,729 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 197 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:27,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 297 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2025-03-04 11:34:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 6096. [2025-03-04 11:34:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 4888 states have (on average 1.2909165302782324) internal successors, (6310), 4980 states have internal predecessors, (6310), 613 states have call successors, (613), 438 states have call predecessors, (613), 589 states have return successors, (961), 679 states have call predecessors, (961), 613 states have call successors, (961) [2025-03-04 11:34:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 7884 transitions. [2025-03-04 11:34:27,979 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 7884 transitions. Word has length 80 [2025-03-04 11:34:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:27,980 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 7884 transitions. [2025-03-04 11:34:27,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:34:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 7884 transitions. [2025-03-04 11:34:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:34:27,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:27,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:27,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:34:27,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:27,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash 330012319, now seen corresponding path program 1 times [2025-03-04 11:34:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:27,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762210130] [2025-03-04 11:34:27,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:27,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:34:27,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:34:27,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:27,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:34:28,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762210130] [2025-03-04 11:34:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762210130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:34:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257227563] [2025-03-04 11:34:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:28,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:28,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:28,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:28,002 INFO L87 Difference]: Start difference. First operand 6096 states and 7884 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:28,150 INFO L93 Difference]: Finished difference Result 10663 states and 13752 transitions. [2025-03-04 11:34:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2025-03-04 11:34:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:28,168 INFO L225 Difference]: With dead ends: 10663 [2025-03-04 11:34:28,169 INFO L226 Difference]: Without dead ends: 4578 [2025-03-04 11:34:28,177 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 11:34:28,177 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:28,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 165 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2025-03-04 11:34:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4578. [2025-03-04 11:34:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 3690 states have (on average 1.2883468834688347) internal successors, (4754), 3753 states have internal predecessors, (4754), 452 states have call successors, (452), 325 states have call predecessors, (452), 430 states have return successors, (678), 500 states have call predecessors, (678), 452 states have call successors, (678) [2025-03-04 11:34:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 5884 transitions. [2025-03-04 11:34:28,342 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 5884 transitions. Word has length 80 [2025-03-04 11:34:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:28,342 INFO L471 AbstractCegarLoop]: Abstraction has 4578 states and 5884 transitions. [2025-03-04 11:34:28,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:34:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 5884 transitions. [2025-03-04 11:34:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:34:28,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:28,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:28,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:34:28,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:28,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -602864953, now seen corresponding path program 1 times [2025-03-04 11:34:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917540324] [2025-03-04 11:34:28,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:28,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:34:28,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:34:28,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:28,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:34:28,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:28,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917540324] [2025-03-04 11:34:28,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917540324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:28,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:28,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:34:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059686324] [2025-03-04 11:34:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:34:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:28,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:34:28,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:28,436 INFO L87 Difference]: Start difference. First operand 4578 states and 5884 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:34:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:29,278 INFO L93 Difference]: Finished difference Result 11883 states and 15413 transitions. [2025-03-04 11:34:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:34:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2025-03-04 11:34:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:29,309 INFO L225 Difference]: With dead ends: 11883 [2025-03-04 11:34:29,310 INFO L226 Difference]: Without dead ends: 7316 [2025-03-04 11:34:29,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:34:29,323 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1042 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:29,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 850 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:34:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2025-03-04 11:34:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6952. [2025-03-04 11:34:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6952 states, 5506 states have (on average 1.248092989466037) internal successors, (6872), 5618 states have internal predecessors, (6872), 724 states have call successors, (724), 513 states have call predecessors, (724), 716 states have return successors, (1089), 822 states have call predecessors, (1089), 724 states have call successors, (1089) [2025-03-04 11:34:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 8685 transitions. [2025-03-04 11:34:29,625 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 8685 transitions. Word has length 81 [2025-03-04 11:34:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:29,626 INFO L471 AbstractCegarLoop]: Abstraction has 6952 states and 8685 transitions. [2025-03-04 11:34:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:34:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 8685 transitions. [2025-03-04 11:34:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:34:29,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:29,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:34:29,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1111712681, now seen corresponding path program 1 times [2025-03-04 11:34:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511667939] [2025-03-04 11:34:29,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:29,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:34:29,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:34:29,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:29,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:34:29,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511667939] [2025-03-04 11:34:29,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511667939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929212753] [2025-03-04 11:34:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:29,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:29,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:29,712 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 11:34:29,714 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 11:34:29,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:34:29,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:34:29,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:29,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:29,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:29,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 11:34:29,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929212753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [9] total 10 [2025-03-04 11:34:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292758643] [2025-03-04 11:34:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:29,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:29,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:29,890 INFO L87 Difference]: Start difference. First operand 6952 states and 8685 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:30,099 INFO L93 Difference]: Finished difference Result 6952 states and 8685 transitions. [2025-03-04 11:34:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-04 11:34:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:30,127 INFO L225 Difference]: With dead ends: 6952 [2025-03-04 11:34:30,127 INFO L226 Difference]: Without dead ends: 6951 [2025-03-04 11:34:30,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:30,131 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:30,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2025-03-04 11:34:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 6951. [2025-03-04 11:34:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6951 states, 5506 states have (on average 1.2357428260079912) internal successors, (6804), 5617 states have internal predecessors, (6804), 724 states have call successors, (724), 513 states have call predecessors, (724), 716 states have return successors, (1089), 822 states have call predecessors, (1089), 724 states have call successors, (1089) [2025-03-04 11:34:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6951 states to 6951 states and 8617 transitions. [2025-03-04 11:34:30,404 INFO L78 Accepts]: Start accepts. Automaton has 6951 states and 8617 transitions. Word has length 106 [2025-03-04 11:34:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:30,406 INFO L471 AbstractCegarLoop]: Abstraction has 6951 states and 8617 transitions. [2025-03-04 11:34:30,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6951 states and 8617 transitions. [2025-03-04 11:34:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:34:30,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:30,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:30,416 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 11:34:30,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:34:30,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:30,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 103354796, now seen corresponding path program 1 times [2025-03-04 11:34:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357868723] [2025-03-04 11:34:30,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:30,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:34:30,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:34:30,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:30,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:34:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357868723] [2025-03-04 11:34:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357868723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114347170] [2025-03-04 11:34:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:30,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:30,708 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 11:34:30,709 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 11:34:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:34:30,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:34:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:30,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:30,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:30,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 11:34:30,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114347170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:30,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [9] total 10 [2025-03-04 11:34:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763419644] [2025-03-04 11:34:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:30,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:30,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:30,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:30,874 INFO L87 Difference]: Start difference. First operand 6951 states and 8617 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:31,403 INFO L93 Difference]: Finished difference Result 20683 states and 25599 transitions. [2025-03-04 11:34:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-04 11:34:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:31,462 INFO L225 Difference]: With dead ends: 20683 [2025-03-04 11:34:31,462 INFO L226 Difference]: Without dead ends: 12377 [2025-03-04 11:34:31,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:31,474 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 90 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:31,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12377 states. [2025-03-04 11:34:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12377 to 12361. [2025-03-04 11:34:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12361 states, 9793 states have (on average 1.2242418053711834) internal successors, (11989), 9985 states have internal predecessors, (11989), 1278 states have call successors, (1278), 914 states have call predecessors, (1278), 1286 states have return successors, (1946), 1462 states have call predecessors, (1946), 1278 states have call successors, (1946) [2025-03-04 11:34:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 15213 transitions. [2025-03-04 11:34:31,956 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 15213 transitions. Word has length 107 [2025-03-04 11:34:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:31,956 INFO L471 AbstractCegarLoop]: Abstraction has 12361 states and 15213 transitions. [2025-03-04 11:34:31,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 15213 transitions. [2025-03-04 11:34:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 11:34:31,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:31,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:31,966 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 11:34:32,164 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,SelfDestructingSolverStorable11 [2025-03-04 11:34:32,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 52066449, now seen corresponding path program 1 times [2025-03-04 11:34:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783226892] [2025-03-04 11:34:32,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:32,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 11:34:32,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 11:34:32,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:32,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 11:34:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783226892] [2025-03-04 11:34:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783226892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819431519] [2025-03-04 11:34:32,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:32,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:32,274 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 11:34:32,276 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 11:34:32,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 11:34:32,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 11:34:32,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:32,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:32,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:32,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 11:34:32,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819431519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 11:34:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494627990] [2025-03-04 11:34:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:32,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:32,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:32,492 INFO L87 Difference]: Start difference. First operand 12361 states and 15213 transitions. Second operand has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:32,836 INFO L93 Difference]: Finished difference Result 12361 states and 15213 transitions. [2025-03-04 11:34:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:32,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2025-03-04 11:34:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:32,868 INFO L225 Difference]: With dead ends: 12361 [2025-03-04 11:34:32,869 INFO L226 Difference]: Without dead ends: 12360 [2025-03-04 11:34:32,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:32,874 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:32,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12360 states. [2025-03-04 11:34:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12360 to 12360. [2025-03-04 11:34:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12360 states, 9793 states have (on average 1.2219953027672827) internal successors, (11967), 9984 states have internal predecessors, (11967), 1278 states have call successors, (1278), 914 states have call predecessors, (1278), 1286 states have return successors, (1946), 1462 states have call predecessors, (1946), 1278 states have call successors, (1946) [2025-03-04 11:34:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12360 states to 12360 states and 15191 transitions. [2025-03-04 11:34:33,596 INFO L78 Accepts]: Start accepts. Automaton has 12360 states and 15191 transitions. Word has length 152 [2025-03-04 11:34:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 12360 states and 15191 transitions. [2025-03-04 11:34:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12360 states and 15191 transitions. [2025-03-04 11:34:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 11:34:33,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:33,600 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:33,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:34:33,804 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 11:34:33,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:33,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1614060024, now seen corresponding path program 1 times [2025-03-04 11:34:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055462329] [2025-03-04 11:34:33,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:33,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 11:34:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 11:34:33,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:33,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 11:34:33,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055462329] [2025-03-04 11:34:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055462329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311281602] [2025-03-04 11:34:33,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:33,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:33,944 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 11:34:33,946 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 11:34:33,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 11:34:34,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 11:34:34,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:34,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:34,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:34,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 11:34:34,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:34,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311281602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:34,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:34,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 11:34:34,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607073553] [2025-03-04 11:34:34,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:34,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:34,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:34,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:34,199 INFO L87 Difference]: Start difference. First operand 12360 states and 15191 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:34,568 INFO L93 Difference]: Finished difference Result 13099 states and 16071 transitions. [2025-03-04 11:34:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 153 [2025-03-04 11:34:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:34,601 INFO L225 Difference]: With dead ends: 13099 [2025-03-04 11:34:34,601 INFO L226 Difference]: Without dead ends: 13098 [2025-03-04 11:34:34,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:34,607 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:34,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13098 states. [2025-03-04 11:34:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13098 to 13098. [2025-03-04 11:34:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13098 states, 10375 states have (on average 1.2182168674698794) internal successors, (12639), 10570 states have internal predecessors, (12639), 1358 states have call successors, (1358), 970 states have call predecessors, (1358), 1362 states have return successors, (2068), 1558 states have call predecessors, (2068), 1358 states have call successors, (2068) [2025-03-04 11:34:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13098 states to 13098 states and 16065 transitions. [2025-03-04 11:34:35,114 INFO L78 Accepts]: Start accepts. Automaton has 13098 states and 16065 transitions. Word has length 153 [2025-03-04 11:34:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:35,114 INFO L471 AbstractCegarLoop]: Abstraction has 13098 states and 16065 transitions. [2025-03-04 11:34:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13098 states and 16065 transitions. [2025-03-04 11:34:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 11:34:35,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:35,117 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:35,123 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 11:34:35,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:35,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1208129626, now seen corresponding path program 1 times [2025-03-04 11:34:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448234298] [2025-03-04 11:34:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:35,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 11:34:35,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 11:34:35,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:35,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 11:34:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448234298] [2025-03-04 11:34:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448234298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320672166] [2025-03-04 11:34:35,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:35,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:35,426 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 11:34:35,427 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 11:34:35,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 11:34:35,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 11:34:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:35,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:35,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:35,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:35,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:35,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320672166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:35,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:35,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 11:34:35,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562828203] [2025-03-04 11:34:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:35,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:35,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:35,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:35,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:35,638 INFO L87 Difference]: Start difference. First operand 13098 states and 16065 transitions. Second operand has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:36,041 INFO L93 Difference]: Finished difference Result 13098 states and 16065 transitions. [2025-03-04 11:34:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 163 [2025-03-04 11:34:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:36,071 INFO L225 Difference]: With dead ends: 13098 [2025-03-04 11:34:36,071 INFO L226 Difference]: Without dead ends: 13097 [2025-03-04 11:34:36,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:36,075 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:36,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13097 states. [2025-03-04 11:34:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13097 to 13097. [2025-03-04 11:34:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13097 states, 10375 states have (on average 1.2160963855421687) internal successors, (12617), 10569 states have internal predecessors, (12617), 1358 states have call successors, (1358), 970 states have call predecessors, (1358), 1362 states have return successors, (2068), 1558 states have call predecessors, (2068), 1358 states have call successors, (2068) [2025-03-04 11:34:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13097 states to 13097 states and 16043 transitions. [2025-03-04 11:34:36,698 INFO L78 Accepts]: Start accepts. Automaton has 13097 states and 16043 transitions. Word has length 163 [2025-03-04 11:34:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 13097 states and 16043 transitions. [2025-03-04 11:34:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13097 states and 16043 transitions. [2025-03-04 11:34:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 11:34:36,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:36,703 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:36,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:36,903 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,SelfDestructingSolverStorable14 [2025-03-04 11:34:36,903 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:36,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1202687336, now seen corresponding path program 1 times [2025-03-04 11:34:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260973827] [2025-03-04 11:34:36,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 11:34:36,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:34:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 11:34:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260973827] [2025-03-04 11:34:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260973827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212821233] [2025-03-04 11:34:37,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:37,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:37,029 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 11:34:37,031 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 11:34:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 11:34:37,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:34:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:37,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:37,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:37,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212821233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-04 11:34:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238851872] [2025-03-04 11:34:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:37,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:37,271 INFO L87 Difference]: Start difference. First operand 13097 states and 16043 transitions. Second operand has 3 states, 2 states have (on average 40.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:38,196 INFO L93 Difference]: Finished difference Result 20074 states and 24619 transitions. [2025-03-04 11:34:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:38,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 40.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 164 [2025-03-04 11:34:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:38,252 INFO L225 Difference]: With dead ends: 20074 [2025-03-04 11:34:38,252 INFO L226 Difference]: Without dead ends: 20073 [2025-03-04 11:34:38,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:38,262 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 52 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:38,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 296 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-04 11:34:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20052. [2025-03-04 11:34:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20052 states, 15865 states have (on average 1.214560352978254) internal successors, (19269), 16184 states have internal predecessors, (19269), 2070 states have call successors, (2070), 1478 states have call predecessors, (2070), 2116 states have return successors, (3234), 2390 states have call predecessors, (3234), 2070 states have call successors, (3234) [2025-03-04 11:34:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20052 states to 20052 states and 24573 transitions. [2025-03-04 11:34:39,107 INFO L78 Accepts]: Start accepts. Automaton has 20052 states and 24573 transitions. Word has length 164 [2025-03-04 11:34:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 20052 states and 24573 transitions. [2025-03-04 11:34:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 40.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 11:34:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20052 states and 24573 transitions. [2025-03-04 11:34:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 11:34:39,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:39,120 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:39,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:39,320 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,SelfDestructingSolverStorable15 [2025-03-04 11:34:39,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 607970001, now seen corresponding path program 1 times [2025-03-04 11:34:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424988521] [2025-03-04 11:34:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:39,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:34:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:34:39,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:39,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-04 11:34:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424988521] [2025-03-04 11:34:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424988521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233939288] [2025-03-04 11:34:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:39,453 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 11:34:39,455 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 11:34:39,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 11:34:39,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 11:34:39,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:39,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:39,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:39,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-04 11:34:39,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233939288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:39,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 11:34:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931073599] [2025-03-04 11:34:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:39,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:39,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:39,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:39,639 INFO L87 Difference]: Start difference. First operand 20052 states and 24573 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 11:34:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:40,884 INFO L93 Difference]: Finished difference Result 58086 states and 71122 transitions. [2025-03-04 11:34:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:40,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 250 [2025-03-04 11:34:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:40,987 INFO L225 Difference]: With dead ends: 58086 [2025-03-04 11:34:40,987 INFO L226 Difference]: Without dead ends: 38553 [2025-03-04 11:34:41,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:41,024 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 73 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38553 states. [2025-03-04 11:34:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38553 to 38356. [2025-03-04 11:34:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38356 states, 30295 states have (on average 1.207625020630467) internal successors, (36585), 30932 states have internal predecessors, (36585), 3940 states have call successors, (3940), 2956 states have call predecessors, (3940), 4120 states have return successors, (5868), 4468 states have call predecessors, (5868), 3940 states have call successors, (5868) [2025-03-04 11:34:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38356 states to 38356 states and 46393 transitions. [2025-03-04 11:34:43,596 INFO L78 Accepts]: Start accepts. Automaton has 38356 states and 46393 transitions. Word has length 250 [2025-03-04 11:34:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:43,598 INFO L471 AbstractCegarLoop]: Abstraction has 38356 states and 46393 transitions. [2025-03-04 11:34:43,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 11:34:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 38356 states and 46393 transitions. [2025-03-04 11:34:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 11:34:43,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:43,619 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:43,625 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 11:34:43,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:43,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:43,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -636877989, now seen corresponding path program 1 times [2025-03-04 11:34:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351400858] [2025-03-04 11:34:43,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:43,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-04 11:34:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351400858] [2025-03-04 11:34:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351400858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255185591] [2025-03-04 11:34:43,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:43,943 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 11:34:43,945 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 11:34:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:44,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:44,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:44,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:44,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:44,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-04 11:34:44,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255185591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 11:34:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300523171] [2025-03-04 11:34:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:44,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:44,184 INFO L87 Difference]: Start difference. First operand 38356 states and 46393 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 11:34:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:46,662 INFO L93 Difference]: Finished difference Result 112442 states and 136742 transitions. [2025-03-04 11:34:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 284 [2025-03-04 11:34:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:46,872 INFO L225 Difference]: With dead ends: 112442 [2025-03-04 11:34:46,872 INFO L226 Difference]: Without dead ends: 74097 [2025-03-04 11:34:46,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:46,942 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74097 states. [2025-03-04 11:34:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74097 to 74096. [2025-03-04 11:34:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74096 states, 58581 states have (on average 1.1949096123316434) internal successors, (69999), 59686 states have internal predecessors, (69999), 7778 states have call successors, (7778), 5912 states have call predecessors, (7778), 7736 states have return successors, (10930), 8498 states have call predecessors, (10930), 7778 states have call successors, (10930) [2025-03-04 11:34:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74096 states to 74096 states and 88707 transitions. [2025-03-04 11:34:50,924 INFO L78 Accepts]: Start accepts. Automaton has 74096 states and 88707 transitions. Word has length 284 [2025-03-04 11:34:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:50,925 INFO L471 AbstractCegarLoop]: Abstraction has 74096 states and 88707 transitions. [2025-03-04 11:34:50,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 11:34:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 74096 states and 88707 transitions. [2025-03-04 11:34:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 11:34:50,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:50,940 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:50,947 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 11:34:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:34:51,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:51,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1848185722, now seen corresponding path program 1 times [2025-03-04 11:34:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18190020] [2025-03-04 11:34:51,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:51,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:51,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:51,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:51,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-04 11:34:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18190020] [2025-03-04 11:34:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18190020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657966022] [2025-03-04 11:34:51,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:51,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:51,261 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 11:34:51,263 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 11:34:51,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:51,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-04 11:34:51,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657966022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 11:34:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156044242] [2025-03-04 11:34:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:51,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:51,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:51,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:51,399 INFO L87 Difference]: Start difference. First operand 74096 states and 88707 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 11:34:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:54,129 INFO L93 Difference]: Finished difference Result 107956 states and 129102 transitions. [2025-03-04 11:34:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 284 [2025-03-04 11:34:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:54,281 INFO L225 Difference]: With dead ends: 107956 [2025-03-04 11:34:54,281 INFO L226 Difference]: Without dead ends: 47387 [2025-03-04 11:34:54,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:54,356 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 122 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:54,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 416 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47387 states. [2025-03-04 11:34:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47387 to 34926. [2025-03-04 11:34:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34926 states, 27734 states have (on average 1.1596956803922982) internal successors, (32163), 28147 states have internal predecessors, (32163), 3723 states have call successors, (3723), 2864 states have call predecessors, (3723), 3468 states have return successors, (4944), 3915 states have call predecessors, (4944), 3723 states have call successors, (4944) [2025-03-04 11:34:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34926 states to 34926 states and 40830 transitions. [2025-03-04 11:34:56,315 INFO L78 Accepts]: Start accepts. Automaton has 34926 states and 40830 transitions. Word has length 284 [2025-03-04 11:34:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:56,316 INFO L471 AbstractCegarLoop]: Abstraction has 34926 states and 40830 transitions. [2025-03-04 11:34:56,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 11:34:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 34926 states and 40830 transitions. [2025-03-04 11:34:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 11:34:56,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:56,334 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:56,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:56,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:56,535 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:56,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1335330587, now seen corresponding path program 1 times [2025-03-04 11:34:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266631941] [2025-03-04 11:34:56,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:56,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-04 11:34:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266631941] [2025-03-04 11:34:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266631941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171857767] [2025-03-04 11:34:56,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:56,686 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 11:34:56,688 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 11:34:56,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 11:34:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 11:34:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:56,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:56,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 11:34:57,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171857767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 11:34:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927377419] [2025-03-04 11:34:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:57,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:57,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:57,006 INFO L87 Difference]: Start difference. First operand 34926 states and 40830 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)