./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:53:35,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:53:35,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:53:35,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:53:35,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:53:35,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:53:35,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:53:35,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:53:35,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:53:35,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:53:35,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:53:35,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:53:35,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:53:35,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:53:35,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:53:35,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:35,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:53:35,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:53:35,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2025-03-09 01:53:36,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:53:36,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:53:36,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:53:36,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:53:36,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:53:36,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2025-03-09 01:53:37,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fa755d6/860865e192ef45f08fb365d6cb477b33/FLAG10bc30ac6 [2025-03-09 01:53:37,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:53:37,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2025-03-09 01:53:37,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fa755d6/860865e192ef45f08fb365d6cb477b33/FLAG10bc30ac6 [2025-03-09 01:53:37,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fa755d6/860865e192ef45f08fb365d6cb477b33 [2025-03-09 01:53:37,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:53:37,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:53:37,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:37,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:53:37,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:53:37,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:37" (1/1) ... [2025-03-09 01:53:37,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df9a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:37, skipping insertion in model container [2025-03-09 01:53:37,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:53:37" (1/1) ... [2025-03-09 01:53:37,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:53:38,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:38,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:53:38,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:53:38,180 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:53:38,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38 WrapperNode [2025-03-09 01:53:38,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:53:38,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:38,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:53:38,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:53:38,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,205 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 117 [2025-03-09 01:53:38,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:53:38,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:53:38,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:53:38,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:53:38,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,226 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [9, 7, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 2, 1]. [2025-03-09 01:53:38,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:53:38,233 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:53:38,233 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:53:38,233 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:53:38,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (1/1) ... [2025-03-09 01:53:38,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:53:38,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:38,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:53:38,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:53:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:53:38,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:53:38,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:53:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:53:38,355 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:53:38,357 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:53:38,472 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;havoc main_#t~ret24#1; [2025-03-09 01:53:38,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc test_fun_#t~mem21#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-09 01:53:38,481 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-09 01:53:38,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:53:38,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:53:38,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:53:38,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:38 BoogieIcfgContainer [2025-03-09 01:53:38,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:53:38,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:53:38,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:53:38,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:53:38,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:53:37" (1/3) ... [2025-03-09 01:53:38,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d7701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:38, skipping insertion in model container [2025-03-09 01:53:38,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:53:38" (2/3) ... [2025-03-09 01:53:38,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191d7701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:53:38, skipping insertion in model container [2025-03-09 01:53:38,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:38" (3/3) ... [2025-03-09 01:53:38,494 INFO L128 eAbstractionObserver]: Analyzing ICFG b.10-alloca.i [2025-03-09 01:53:38,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:53:38,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.10-alloca.i that has 1 procedures, 38 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-09 01:53:38,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:53:38,548 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;@53cbd8c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:53:38,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:53:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:53:38,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:38,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:53:38,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:38,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 75357261, now seen corresponding path program 1 times [2025-03-09 01:53:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544380559] [2025-03-09 01:53:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:38,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:53:38,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:53:38,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:38,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544380559] [2025-03-09 01:53:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544380559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:38,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:38,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352768709] [2025-03-09 01:53:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:38,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:38,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:38,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:38,955 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,017 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-03-09 01:53:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:53:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,024 INFO L225 Difference]: With dead ends: 43 [2025-03-09 01:53:39,024 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:53:39,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:39,029 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:53:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 01:53:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-09 01:53:39,056 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 5 [2025-03-09 01:53:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,057 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-09 01:53:39,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-09 01:53:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:53:39,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:53:39,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1958892195, now seen corresponding path program 1 times [2025-03-09 01:53:39,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672060069] [2025-03-09 01:53:39,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:53:39,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:53:39,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672060069] [2025-03-09 01:53:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672060069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:39,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999759421] [2025-03-09 01:53:39,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:39,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:39,137 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,170 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-09 01:53:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:53:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,170 INFO L225 Difference]: With dead ends: 33 [2025-03-09 01:53:39,171 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:53:39,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:39,171 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:53:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-09 01:53:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.608695652173913) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-09 01:53:39,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2025-03-09 01:53:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,174 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-09 01:53:39,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-09 01:53:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:53:39,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:53:39,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1298892324, now seen corresponding path program 1 times [2025-03-09 01:53:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079267934] [2025-03-09 01:53:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:53:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:53:39,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079267934] [2025-03-09 01:53:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079267934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537164692] [2025-03-09 01:53:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:39,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:39,338 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,411 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-03-09 01:53:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:53:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,412 INFO L225 Difference]: With dead ends: 60 [2025-03-09 01:53:39,412 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 01:53:39,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:39,413 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 01:53:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-03-09 01:53:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2025-03-09 01:53:39,417 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 8 [2025-03-09 01:53:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2025-03-09 01:53:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2025-03-09 01:53:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:53:39,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:53:39,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1610956379, now seen corresponding path program 1 times [2025-03-09 01:53:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331896241] [2025-03-09 01:53:39,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:53:39,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:53:39,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331896241] [2025-03-09 01:53:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331896241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344274433] [2025-03-09 01:53:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:39,526 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,563 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2025-03-09 01:53:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:39,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:53:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,564 INFO L225 Difference]: With dead ends: 98 [2025-03-09 01:53:39,564 INFO L226 Difference]: Without dead ends: 97 [2025-03-09 01:53:39,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:39,565 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 78 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-09 01:53:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2025-03-09 01:53:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.575) internal successors, (126), 87 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2025-03-09 01:53:39,570 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 9 [2025-03-09 01:53:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2025-03-09 01:53:39,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2025-03-09 01:53:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:53:39,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:53:39,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1610932546, now seen corresponding path program 1 times [2025-03-09 01:53:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117226398] [2025-03-09 01:53:39,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:53:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:53:39,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117226398] [2025-03-09 01:53:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117226398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744103937] [2025-03-09 01:53:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:39,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:39,606 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,626 INFO L93 Difference]: Finished difference Result 159 states and 226 transitions. [2025-03-09 01:53:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:53:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,629 INFO L225 Difference]: With dead ends: 159 [2025-03-09 01:53:39,629 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 01:53:39,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:39,630 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 01:53:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 01:53:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.5476190476190477) internal successors, (130), 91 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-03-09 01:53:39,638 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 9 [2025-03-09 01:53:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,638 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-03-09 01:53:39,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-03-09 01:53:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:53:39,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:53:39,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 801237273, now seen corresponding path program 1 times [2025-03-09 01:53:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80048774] [2025-03-09 01:53:39,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:53:39,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:53:39,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80048774] [2025-03-09 01:53:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80048774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528340182] [2025-03-09 01:53:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:39,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:39,738 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:39,769 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2025-03-09 01:53:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:53:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:39,770 INFO L225 Difference]: With dead ends: 92 [2025-03-09 01:53:39,770 INFO L226 Difference]: Without dead ends: 91 [2025-03-09 01:53:39,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:39,771 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:39,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 50 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-09 01:53:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2025-03-09 01:53:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.5) internal successors, (69), 52 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-03-09 01:53:39,776 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 10 [2025-03-09 01:53:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:39,776 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-03-09 01:53:39,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-03-09 01:53:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:53:39,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:39,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:39,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:53:39,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -931424479, now seen corresponding path program 1 times [2025-03-09 01:53:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212964650] [2025-03-09 01:53:39,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:39,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:53:39,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:53:39,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:39,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212964650] [2025-03-09 01:53:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212964650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314170685] [2025-03-09 01:53:39,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:39,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:39,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:39,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:39,931 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,041 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2025-03-09 01:53:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:53:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:53:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,042 INFO L225 Difference]: With dead ends: 147 [2025-03-09 01:53:40,044 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 01:53:40,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:53:40,045 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 101 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 101 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 01:53:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2025-03-09 01:53:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 122 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2025-03-09 01:53:40,060 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 11 [2025-03-09 01:53:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,061 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2025-03-09 01:53:40,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2025-03-09 01:53:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:53:40,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:53:40,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1940021531, now seen corresponding path program 1 times [2025-03-09 01:53:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553106772] [2025-03-09 01:53:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:53:40,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:53:40,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553106772] [2025-03-09 01:53:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553106772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768740599] [2025-03-09 01:53:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:40,116 INFO L87 Difference]: Start difference. First operand 123 states and 171 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,138 INFO L93 Difference]: Finished difference Result 268 states and 370 transitions. [2025-03-09 01:53:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:40,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:53:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,140 INFO L225 Difference]: With dead ends: 268 [2025-03-09 01:53:40,140 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:53:40,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:40,141 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:53:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-09 01:53:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 122 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2025-03-09 01:53:40,153 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 11 [2025-03-09 01:53:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,153 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2025-03-09 01:53:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2025-03-09 01:53:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:53:40,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:53:40,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1190612216, now seen corresponding path program 1 times [2025-03-09 01:53:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039918812] [2025-03-09 01:53:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:53:40,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:53:40,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039918812] [2025-03-09 01:53:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039918812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257642694] [2025-03-09 01:53:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:40,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:40,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:40,328 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,432 INFO L93 Difference]: Finished difference Result 214 states and 275 transitions. [2025-03-09 01:53:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:53:40,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 01:53:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,434 INFO L225 Difference]: With dead ends: 214 [2025-03-09 01:53:40,434 INFO L226 Difference]: Without dead ends: 213 [2025-03-09 01:53:40,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:53:40,435 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 107 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-09 01:53:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2025-03-09 01:53:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 192 states have (on average 1.328125) internal successors, (255), 198 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 255 transitions. [2025-03-09 01:53:40,449 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 255 transitions. Word has length 12 [2025-03-09 01:53:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,449 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 255 transitions. [2025-03-09 01:53:40,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 255 transitions. [2025-03-09 01:53:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:53:40,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:53:40,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1144560894, now seen corresponding path program 1 times [2025-03-09 01:53:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695054301] [2025-03-09 01:53:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:53:40,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:53:40,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695054301] [2025-03-09 01:53:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695054301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399511766] [2025-03-09 01:53:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:40,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:40,625 INFO L87 Difference]: Start difference. First operand 199 states and 255 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:40,753 INFO L93 Difference]: Finished difference Result 220 states and 277 transitions. [2025-03-09 01:53:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:53:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:53:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:40,754 INFO L225 Difference]: With dead ends: 220 [2025-03-09 01:53:40,754 INFO L226 Difference]: Without dead ends: 219 [2025-03-09 01:53:40,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:53:40,755 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:40,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 115 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-09 01:53:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2025-03-09 01:53:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 174 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2025-03-09 01:53:40,761 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 13 [2025-03-09 01:53:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2025-03-09 01:53:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2025-03-09 01:53:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:53:40,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:40,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:53:40,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1121649353, now seen corresponding path program 1 times [2025-03-09 01:53:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283414884] [2025-03-09 01:53:40,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:40,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:53:40,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:53:40,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:40,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283414884] [2025-03-09 01:53:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283414884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:40,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:40,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842103826] [2025-03-09 01:53:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:40,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:40,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:40,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:40,915 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,010 INFO L93 Difference]: Finished difference Result 332 states and 418 transitions. [2025-03-09 01:53:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:53:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:53:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,014 INFO L225 Difference]: With dead ends: 332 [2025-03-09 01:53:41,015 INFO L226 Difference]: Without dead ends: 331 [2025-03-09 01:53:41,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:53:41,015 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 123 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-09 01:53:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 167. [2025-03-09 01:53:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 160 states have (on average 1.3125) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 210 transitions. [2025-03-09 01:53:41,027 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 210 transitions. Word has length 14 [2025-03-09 01:53:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,027 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 210 transitions. [2025-03-09 01:53:41,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 210 transitions. [2025-03-09 01:53:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:53:41,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:53:41,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1688588190, now seen corresponding path program 1 times [2025-03-09 01:53:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918122003] [2025-03-09 01:53:41,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:53:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:53:41,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918122003] [2025-03-09 01:53:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918122003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:53:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666468427] [2025-03-09 01:53:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:41,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,115 INFO L87 Difference]: Start difference. First operand 167 states and 210 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,172 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2025-03-09 01:53:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:53:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,173 INFO L225 Difference]: With dead ends: 248 [2025-03-09 01:53:41,173 INFO L226 Difference]: Without dead ends: 247 [2025-03-09 01:53:41,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:41,174 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 96 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-09 01:53:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2025-03-09 01:53:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 240 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 306 transitions. [2025-03-09 01:53:41,182 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 306 transitions. Word has length 15 [2025-03-09 01:53:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,182 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 306 transitions. [2025-03-09 01:53:41,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 306 transitions. [2025-03-09 01:53:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:41,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:53:41,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1394559668, now seen corresponding path program 1 times [2025-03-09 01:53:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251334665] [2025-03-09 01:53:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:41,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:41,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251334665] [2025-03-09 01:53:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251334665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787098701] [2025-03-09 01:53:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:41,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,248 INFO L87 Difference]: Start difference. First operand 241 states and 306 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,283 INFO L93 Difference]: Finished difference Result 386 states and 488 transitions. [2025-03-09 01:53:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:41,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,288 INFO L225 Difference]: With dead ends: 386 [2025-03-09 01:53:41,288 INFO L226 Difference]: Without dead ends: 167 [2025-03-09 01:53:41,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:41,289 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 87 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-09 01:53:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 106. [2025-03-09 01:53:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 100 states have (on average 1.29) internal successors, (129), 105 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2025-03-09 01:53:41,296 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 16 [2025-03-09 01:53:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,296 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2025-03-09 01:53:41,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2025-03-09 01:53:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:41,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:53:41,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 806633266, now seen corresponding path program 1 times [2025-03-09 01:53:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30045569] [2025-03-09 01:53:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:41,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:41,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30045569] [2025-03-09 01:53:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30045569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:53:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640686703] [2025-03-09 01:53:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:53:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:53:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:41,433 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,567 INFO L93 Difference]: Finished difference Result 223 states and 262 transitions. [2025-03-09 01:53:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:53:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,569 INFO L225 Difference]: With dead ends: 223 [2025-03-09 01:53:41,569 INFO L226 Difference]: Without dead ends: 222 [2025-03-09 01:53:41,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:53:41,569 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 164 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-09 01:53:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 105. [2025-03-09 01:53:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 104 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-03-09 01:53:41,575 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 16 [2025-03-09 01:53:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,575 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-03-09 01:53:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-03-09 01:53:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:53:41,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:53:41,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 806626315, now seen corresponding path program 1 times [2025-03-09 01:53:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393879013] [2025-03-09 01:53:41,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:53:41,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:53:41,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393879013] [2025-03-09 01:53:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393879013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793032824] [2025-03-09 01:53:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:41,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:41,620 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,640 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2025-03-09 01:53:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:53:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,641 INFO L225 Difference]: With dead ends: 105 [2025-03-09 01:53:41,641 INFO L226 Difference]: Without dead ends: 104 [2025-03-09 01:53:41,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:41,642 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-09 01:53:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-09 01:53:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.24) internal successors, (124), 103 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-03-09 01:53:41,646 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 16 [2025-03-09 01:53:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,646 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-03-09 01:53:41,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-03-09 01:53:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:53:41,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:53:41,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash -764172548, now seen corresponding path program 1 times [2025-03-09 01:53:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263774219] [2025-03-09 01:53:41,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:53:41,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:53:41,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263774219] [2025-03-09 01:53:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263774219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:53:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842436750] [2025-03-09 01:53:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:53:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:53:41,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:53:41,705 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,723 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-03-09 01:53:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:53:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:53:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,724 INFO L225 Difference]: With dead ends: 104 [2025-03-09 01:53:41,724 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 01:53:41,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 01:53:41,725 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 01:53:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-09 01:53:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.21) internal successors, (121), 102 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-03-09 01:53:41,733 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 17 [2025-03-09 01:53:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,733 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-03-09 01:53:41,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-03-09 01:53:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:53:41,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:53:41,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -210320641, now seen corresponding path program 1 times [2025-03-09 01:53:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081392391] [2025-03-09 01:53:41,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:53:41,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:53:41,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081392391] [2025-03-09 01:53:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081392391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119728391] [2025-03-09 01:53:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:53:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:53:41,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:53:41,812 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:41,846 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2025-03-09 01:53:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:53:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:41,847 INFO L225 Difference]: With dead ends: 204 [2025-03-09 01:53:41,847 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 01:53:41,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:41,848 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:41,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 98 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 01:53:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-09 01:53:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2025-03-09 01:53:41,859 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 17 [2025-03-09 01:53:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:41,859 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2025-03-09 01:53:41,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2025-03-09 01:53:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:53:41,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:41,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:53:41,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:41,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -622410693, now seen corresponding path program 1 times [2025-03-09 01:53:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436527026] [2025-03-09 01:53:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:41,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:53:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:53:41,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:41,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436527026] [2025-03-09 01:53:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436527026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:53:41,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:53:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:53:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431612487] [2025-03-09 01:53:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:53:41,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:41,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:41,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:41,969 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,039 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2025-03-09 01:53:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:53:42,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-09 01:53:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,041 INFO L225 Difference]: With dead ends: 191 [2025-03-09 01:53:42,041 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 01:53:42,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:53:42,042 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 156 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 01:53:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 99. [2025-03-09 01:53:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-03-09 01:53:42,050 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 23 [2025-03-09 01:53:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-03-09 01:53:42,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-03-09 01:53:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:53:42,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:53:42,053 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash -712538010, now seen corresponding path program 1 times [2025-03-09 01:53:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:42,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135523662] [2025-03-09 01:53:42,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:53:42,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:53:42,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135523662] [2025-03-09 01:53:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135523662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104270020] [2025-03-09 01:53:42,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:42,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:42,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:42,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:53:42,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:53:42,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:53:42,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:53:42,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:42,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:42,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:53:42,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-03-09 01:53:42,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-09 01:53:42,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 01:53:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:53:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104270020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:53:42,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:53:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-09 01:53:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795133653] [2025-03-09 01:53:42,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:53:42,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:53:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:42,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:53:42,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:53:42,600 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:42,781 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2025-03-09 01:53:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:53:42,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 01:53:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:42,782 INFO L225 Difference]: With dead ends: 175 [2025-03-09 01:53:42,782 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 01:53:42,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:53:42,783 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 62 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:42,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 174 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:53:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 01:53:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 44. [2025-03-09 01:53:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-09 01:53:42,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2025-03-09 01:53:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:42,785 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-09 01:53:42,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-09 01:53:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 01:53:42,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:53:42,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:42,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:53:42,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:43,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:53:43,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:53:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1654185796, now seen corresponding path program 1 times [2025-03-09 01:53:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:53:43,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625519023] [2025-03-09 01:53:43,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:53:43,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:53:43,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:53:43,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:53:43,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625519023] [2025-03-09 01:53:43,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625519023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:53:43,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375731168] [2025-03-09 01:53:43,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:53:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:53:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:53:43,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:53:43,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:53:43,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:53:43,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:53:43,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:53:43,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:53:43,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:53:43,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:53:43,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:53:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:53:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:53:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375731168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:53:43,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:53:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-09 01:53:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335286035] [2025-03-09 01:53:43,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:53:43,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:53:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:53:43,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:53:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:53:43,246 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:53:43,278 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2025-03-09 01:53:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:53:43,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 01:53:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:53:43,279 INFO L225 Difference]: With dead ends: 86 [2025-03-09 01:53:43,279 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:53:43,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:53:43,280 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:53:43,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:53:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:53:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:53:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:53:43,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-09 01:53:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:53:43,283 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:53:43,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:53:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:53:43,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:53:43,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 01:53:43,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 01:53:43,297 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-09 01:53:43,491 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,SelfDestructingSolverStorable19 [2025-03-09 01:53:43,493 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:53:43,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:53:43,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:53:43,752 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:43,752 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-09 01:53:43,753 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-09 01:53:43,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-03-09 01:53:43,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-09 01:53:43,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-09 01:53:43,754 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-03-09 01:53:43,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:53:43 BoogieIcfgContainer [2025-03-09 01:53:43,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:53:43,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:53:43,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:53:43,755 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:53:43,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:53:38" (3/4) ... [2025-03-09 01:53:43,757 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:53:43,763 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 01:53:43,765 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:53:43,765 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:53:43,765 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:53:43,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:53:43,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:53:43,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:53:43,823 INFO L158 Benchmark]: Toolchain (without parser) took 5937.86ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.3MB in the beginning and 109.7MB in the end (delta: 23.6MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.96ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 116.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.98ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 115.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: IcfgBuilder took 254.77ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 98.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:53:43,824 INFO L158 Benchmark]: TraceAbstraction took 5264.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 97.8MB in the beginning and 116.1MB in the end (delta: -18.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-03-09 01:53:43,825 INFO L158 Benchmark]: Witness Printer took 67.56ms. Allocated memory is still 201.3MB. Free memory was 116.1MB in the beginning and 109.7MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:53:43,827 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.96ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 116.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.98ms. Allocated memory is still 167.8MB. Free memory was 116.8MB in the beginning and 115.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 254.77ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 98.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5264.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 97.8MB in the beginning and 116.1MB in the end (delta: -18.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 67.56ms. Allocated memory is still 201.3MB. Free memory was 116.1MB in the beginning and 109.7MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 45 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 1999 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1398 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1107 IncrementalHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 601 mSDtfsCounter, 1107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=12, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 602 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 2329 SizeOfPredicates, 9 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 115/121 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:53:43,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE