./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1009b309b84d3a678e4f12db10e873a2b96e065352111c00074b04d416cca18d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:53:00,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:53:00,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:53:00,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:53:00,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:53:01,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:53:01,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:53:01,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:53:01,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:53:01,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:53:01,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:53:01,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:53:01,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:53:01,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:53:01,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:53:01,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:53:01,019 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:53:01,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:01,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:53:01,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1009b309b84d3a678e4f12db10e873a2b96e065352111c00074b04d416cca18d [2025-03-04 10:53:01,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:53:01,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:53:01,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:53:01,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:53:01,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:53:01,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c [2025-03-04 10:53:02,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c622b869/d7ff662fbfc04b4cb0c46e582d340529/FLAGe6603d588 [2025-03-04 10:53:02,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:53:02,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound1.c [2025-03-04 10:53:02,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c622b869/d7ff662fbfc04b4cb0c46e582d340529/FLAGe6603d588 [2025-03-04 10:53:02,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c622b869/d7ff662fbfc04b4cb0c46e582d340529 [2025-03-04 10:53:02,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:53:02,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:53:02,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:02,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:53:02,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:53:02,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:02" (1/1) ... [2025-03-04 10:53:02,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:02, skipping insertion in model container [2025-03-04 10:53:02,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:53:02" (1/1) ... [2025-03-04 10:53:02,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:53:03,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:03,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:53:03,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:53:03,091 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:53:03,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03 WrapperNode [2025-03-04 10:53:03,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:53:03,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:03,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:53:03,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:53:03,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,134 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 189 [2025-03-04 10:53:03,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:53:03,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:53:03,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:53:03,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:53:03,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,155 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:53:03,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:53:03,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:53:03,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:53:03,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:53:03,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (1/1) ... [2025-03-04 10:53:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:53:03,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:03,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:53:03,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:53:03,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:53:03,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:53:03,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:53:03,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:53:03,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:53:03,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:53:03,267 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:53:03,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:53:03,813 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-04 10:53:03,813 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:53:03,831 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:53:03,833 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:53:03,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:03 BoogieIcfgContainer [2025-03-04 10:53:03,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:53:03,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:53:03,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:53:03,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:53:03,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:53:02" (1/3) ... [2025-03-04 10:53:03,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc058d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:03, skipping insertion in model container [2025-03-04 10:53:03,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:53:03" (2/3) ... [2025-03-04 10:53:03,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc058d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:53:03, skipping insertion in model container [2025-03-04 10:53:03,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:03" (3/3) ... [2025-03-04 10:53:03,840 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound1.c [2025-03-04 10:53:03,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:53:03,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_valuebound1.c that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 138 error locations. [2025-03-04 10:53:03,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:53:03,906 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;@7ce8ad92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:53:03,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-04 10:53:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:53:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:03,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:03,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:03,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 312024932, now seen corresponding path program 1 times [2025-03-04 10:53:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069315239] [2025-03-04 10:53:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:03,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:03,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069315239] [2025-03-04 10:53:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069315239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627006396] [2025-03-04 10:53:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:53:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:53:04,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:53:04,036 INFO L87 Difference]: Start difference. First operand has 302 states, 151 states have (on average 1.9403973509933774) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,076 INFO L93 Difference]: Finished difference Result 593 states and 636 transitions. [2025-03-04 10:53:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:53:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:53:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,084 INFO L225 Difference]: With dead ends: 593 [2025-03-04 10:53:04,084 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:53:04,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:53:04,092 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:53:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 10:53:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 146 states have (on average 1.8972602739726028) internal successors, (277), 276 states have internal predecessors, (277), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:53:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 297 transitions. [2025-03-04 10:53:04,145 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 297 transitions. Word has length 5 [2025-03-04 10:53:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 297 transitions. [2025-03-04 10:53:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 297 transitions. [2025-03-04 10:53:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:53:04,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:04,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:53:04,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:53:04,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:04,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash 312025893, now seen corresponding path program 1 times [2025-03-04 10:53:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030981140] [2025-03-04 10:53:04,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:53:04,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:53:04,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:53:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030981140] [2025-03-04 10:53:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030981140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:04,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:04,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576321089] [2025-03-04 10:53:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:04,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,217 INFO L87 Difference]: Start difference. First operand 288 states and 297 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,329 INFO L93 Difference]: Finished difference Result 556 states and 575 transitions. [2025-03-04 10:53:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:53:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,333 INFO L225 Difference]: With dead ends: 556 [2025-03-04 10:53:04,335 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 10:53:04,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,336 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 237 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 520 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 10:53:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 346. [2025-03-04 10:53:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 199 states have (on average 1.7989949748743719) internal successors, (358), 329 states have internal predecessors, (358), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:53:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2025-03-04 10:53:04,353 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 5 [2025-03-04 10:53:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,353 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2025-03-04 10:53:04,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:53:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2025-03-04 10:53:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:53:04,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:04,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:53:04,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:04,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -857936794, now seen corresponding path program 1 times [2025-03-04 10:53:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-04 10:53:04,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:04,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:04,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:04,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259168034] [2025-03-04 10:53:04,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:04,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:04,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:04,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:53:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:53:04,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:53:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:04,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125504600] [2025-03-04 10:53:04,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259168034] [2025-03-04 10:53:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259168034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:04,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:04,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126435571] [2025-03-04 10:53:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:04,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,588 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,978 INFO L93 Difference]: Finished difference Result 506 states and 563 transitions. [2025-03-04 10:53:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 10:53:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,981 INFO L225 Difference]: With dead ends: 506 [2025-03-04 10:53:04,981 INFO L226 Difference]: Without dead ends: 451 [2025-03-04 10:53:04,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:04,981 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 267 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-04 10:53:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2025-03-04 10:53:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.6523297491039426) internal successors, (461), 409 states have internal predecessors, (461), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 501 transitions. [2025-03-04 10:53:04,999 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 501 transitions. Word has length 38 [2025-03-04 10:53:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,999 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 501 transitions. [2025-03-04 10:53:04,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 501 transitions. [2025-03-04 10:53:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:53:05,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:05,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:05,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:05,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash 156468804, now seen corresponding path program 1 times [2025-03-04 10:53:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844659475] [2025-03-04 10:53:05,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:53:05,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:53:05,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844659475] [2025-03-04 10:53:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844659475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649438680] [2025-03-04 10:53:05,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:05,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:05,324 INFO L87 Difference]: Start difference. First operand 431 states and 501 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,545 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2025-03-04 10:53:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 10:53:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,547 INFO L225 Difference]: With dead ends: 464 [2025-03-04 10:53:05,548 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:05,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:05,549 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 425 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5698924731182795) internal successors, (438), 409 states have internal predecessors, (438), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 478 transitions. [2025-03-04 10:53:05,564 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 478 transitions. Word has length 40 [2025-03-04 10:53:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,564 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 478 transitions. [2025-03-04 10:53:05,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 478 transitions. [2025-03-04 10:53:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:53:05,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:53:05,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 42672162, now seen corresponding path program 1 times [2025-03-04 10:53:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885240695] [2025-03-04 10:53:05,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:53:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:53:05,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885240695] [2025-03-04 10:53:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885240695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629085985] [2025-03-04 10:53:05,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:05,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,674 INFO L87 Difference]: Start difference. First operand 431 states and 478 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,950 INFO L93 Difference]: Finished difference Result 443 states and 485 transitions. [2025-03-04 10:53:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 10:53:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,952 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:05,952 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:05,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,953 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 367 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5627240143369177) internal successors, (436), 409 states have internal predecessors, (436), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 476 transitions. [2025-03-04 10:53:05,981 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 476 transitions. Word has length 42 [2025-03-04 10:53:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,981 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 476 transitions. [2025-03-04 10:53:05,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 476 transitions. [2025-03-04 10:53:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:53:05,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:53:05,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:05,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1322837233, now seen corresponding path program 1 times [2025-03-04 10:53:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971707233] [2025-03-04 10:53:05,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:53:06,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:53:06,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971707233] [2025-03-04 10:53:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971707233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128653824] [2025-03-04 10:53:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:06,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:06,087 INFO L87 Difference]: Start difference. First operand 431 states and 476 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,099 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2025-03-04 10:53:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-04 10:53:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,102 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:07,103 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:07,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:07,104 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 136 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 448 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:53:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2025-03-04 10:53:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5555555555555556) internal successors, (434), 409 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 474 transitions. [2025-03-04 10:53:07,121 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 474 transitions. Word has length 43 [2025-03-04 10:53:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,121 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 474 transitions. [2025-03-04 10:53:07,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 474 transitions. [2025-03-04 10:53:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:53:07,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:53:07,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:07,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1975692322, now seen corresponding path program 1 times [2025-03-04 10:53:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 10:53:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:07,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:07,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607142228] [2025-03-04 10:53:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:07,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:07,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:53:07,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:53:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:53:07,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:53:07,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:07,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:07,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 10:53:07,352 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:07,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607142228] [2025-03-04 10:53:07,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607142228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:07,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716097601] [2025-03-04 10:53:07,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:07,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:07,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:07,353 INFO L87 Difference]: Start difference. First operand 431 states and 474 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,655 INFO L93 Difference]: Finished difference Result 448 states and 481 transitions. [2025-03-04 10:53:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 10:53:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,658 INFO L225 Difference]: With dead ends: 448 [2025-03-04 10:53:07,658 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 10:53:07,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:07,658 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 257 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 10:53:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2025-03-04 10:53:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 412 states have internal predecessors, (431), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 471 transitions. [2025-03-04 10:53:07,669 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 471 transitions. Word has length 46 [2025-03-04 10:53:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 471 transitions. [2025-03-04 10:53:07,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 471 transitions. [2025-03-04 10:53:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:53:07,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:07,874 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,SelfDestructingSolverStorable6 [2025-03-04 10:53:07,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1116919635, now seen corresponding path program 1 times [2025-03-04 10:53:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871561421] [2025-03-04 10:53:07,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:53:07,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:53:07,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871561421] [2025-03-04 10:53:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871561421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918992352] [2025-03-04 10:53:07,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:07,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:07,959 INFO L87 Difference]: Start difference. First operand 434 states and 471 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,395 INFO L93 Difference]: Finished difference Result 447 states and 472 transitions. [2025-03-04 10:53:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:08,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:53:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,398 INFO L225 Difference]: With dead ends: 447 [2025-03-04 10:53:08,399 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 10:53:08,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:08,400 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 132 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 384 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 10:53:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2025-03-04 10:53:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 412 states have internal predecessors, (425), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 465 transitions. [2025-03-04 10:53:08,412 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 465 transitions. Word has length 47 [2025-03-04 10:53:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,412 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 465 transitions. [2025-03-04 10:53:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 465 transitions. [2025-03-04 10:53:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:53:08,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:53:08,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2088594537, now seen corresponding path program 1 times [2025-03-04 10:53:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-03-04 10:53:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:08,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:53:08,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:53:08,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-03-04 10:53:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621926463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004865933] [2025-03-04 10:53:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:08,518 INFO L87 Difference]: Start difference. First operand 434 states and 465 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,812 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2025-03-04 10:53:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-04 10:53:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,814 INFO L225 Difference]: With dead ends: 445 [2025-03-04 10:53:08,814 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 10:53:08,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:08,815 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 269 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 10:53:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2025-03-04 10:53:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 219 states have (on average 1.6255707762557077) internal successors, (356), 349 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 390 transitions. [2025-03-04 10:53:08,824 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 390 transitions. Word has length 51 [2025-03-04 10:53:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,824 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 390 transitions. [2025-03-04 10:53:08,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 390 transitions. [2025-03-04 10:53:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 10:53:08,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,825 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:53:08,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1053201178, now seen corresponding path program 1 times [2025-03-04 10:53:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613290745] [2025-03-04 10:53:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:08,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 10:53:08,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 10:53:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613290745] [2025-03-04 10:53:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613290745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:08,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:08,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513241136] [2025-03-04 10:53:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:08,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:08,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:08,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:08,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:08,895 INFO L87 Difference]: Start difference. First operand 368 states and 390 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,142 INFO L93 Difference]: Finished difference Result 368 states and 390 transitions. [2025-03-04 10:53:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2025-03-04 10:53:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,144 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:09,144 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:09,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,145 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 155 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 342 states have internal predecessors, (349), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 383 transitions. [2025-03-04 10:53:09,153 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 383 transitions. Word has length 83 [2025-03-04 10:53:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,153 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 383 transitions. [2025-03-04 10:53:09,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 383 transitions. [2025-03-04 10:53:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 10:53:09,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,154 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:53:09,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1710501997, now seen corresponding path program 1 times [2025-03-04 10:53:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807508738] [2025-03-04 10:53:09,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 10:53:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:53:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807508738] [2025-03-04 10:53:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807508738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:09,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:09,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708350996] [2025-03-04 10:53:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:09,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,206 INFO L87 Difference]: Start difference. First operand 361 states and 383 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,361 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2025-03-04 10:53:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2025-03-04 10:53:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,363 INFO L225 Difference]: With dead ends: 368 [2025-03-04 10:53:09,363 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 10:53:09,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,363 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 392 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 10:53:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2025-03-04 10:53:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 221 states have (on average 1.588235294117647) internal successors, (351), 344 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 385 transitions. [2025-03-04 10:53:09,371 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 385 transitions. Word has length 84 [2025-03-04 10:53:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,371 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 385 transitions. [2025-03-04 10:53:09,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 385 transitions. [2025-03-04 10:53:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:09,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,372 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:53:09,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:09,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1214160528, now seen corresponding path program 1 times [2025-03-04 10:53:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-03-04 10:53:09,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:09,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:09,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-03-04 10:53:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285262661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-03-04 10:53:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,435 INFO L87 Difference]: Start difference. First operand 363 states and 385 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,495 INFO L93 Difference]: Finished difference Result 363 states and 385 transitions. [2025-03-04 10:53:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2025-03-04 10:53:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,497 INFO L225 Difference]: With dead ends: 363 [2025-03-04 10:53:09,497 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 10:53:09,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:09,497 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 192 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 10:53:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-04 10:53:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 342 states have internal predecessors, (347), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 381 transitions. [2025-03-04 10:53:09,507 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 381 transitions. Word has length 86 [2025-03-04 10:53:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,507 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 381 transitions. [2025-03-04 10:53:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2025-03-04 10:53:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:53:09,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,509 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:53:09,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:09,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1485954615, now seen corresponding path program 1 times [2025-03-04 10:53:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27969165] [2025-03-04 10:53:09,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27969165] [2025-03-04 10:53:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27969165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476802955] [2025-03-04 10:53:09,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:09,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:09,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:09,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:09,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:53:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:09,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:09,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:09,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476802955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:09,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:09,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:53:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340098748] [2025-03-04 10:53:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:09,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:09,702 INFO L87 Difference]: Start difference. First operand 361 states and 381 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,787 INFO L93 Difference]: Finished difference Result 365 states and 381 transitions. [2025-03-04 10:53:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:09,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 10:53:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,789 INFO L225 Difference]: With dead ends: 365 [2025-03-04 10:53:09,789 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 10:53:09,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:09,790 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 258 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 394 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 10:53:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2025-03-04 10:53:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 334 states have internal predecessors, (339), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 373 transitions. [2025-03-04 10:53:09,799 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 373 transitions. Word has length 85 [2025-03-04 10:53:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,799 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 373 transitions. [2025-03-04 10:53:09,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 373 transitions. [2025-03-04 10:53:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 10:53:09,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,801 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:10,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1015729430, now seen corresponding path program 1 times [2025-03-04 10:53:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-04 10:53:10,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 10:53:10,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 10:53:10,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-04 10:53:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865387859] [2025-03-04 10:53:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:10,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:10,067 INFO L87 Difference]: Start difference. First operand 353 states and 373 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:10,212 INFO L93 Difference]: Finished difference Result 357 states and 373 transitions. [2025-03-04 10:53:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2025-03-04 10:53:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:10,216 INFO L225 Difference]: With dead ends: 357 [2025-03-04 10:53:10,216 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 10:53:10,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:10,217 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 48 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:10,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 700 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 10:53:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-04 10:53:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 219 states have (on average 1.5296803652968036) internal successors, (335), 332 states have internal predecessors, (335), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 369 transitions. [2025-03-04 10:53:10,225 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 369 transitions. Word has length 87 [2025-03-04 10:53:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 369 transitions. [2025-03-04 10:53:10,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 369 transitions. [2025-03-04 10:53:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:10,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,226 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:53:10,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1180046933, now seen corresponding path program 1 times [2025-03-04 10:53:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-03-04 10:53:10,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:10,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-03-04 10:53:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703300574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875867155] [2025-03-04 10:53:10,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:53:10,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:10,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:10,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875867155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:10,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:53:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980183451] [2025-03-04 10:53:10,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:10,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:10,485 INFO L87 Difference]: Start difference. First operand 351 states and 369 transitions. Second operand has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:10,622 INFO L93 Difference]: Finished difference Result 610 states and 648 transitions. [2025-03-04 10:53:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:10,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 86 [2025-03-04 10:53:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:10,624 INFO L225 Difference]: With dead ends: 610 [2025-03-04 10:53:10,624 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 10:53:10,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:10,625 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 467 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:10,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 743 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 10:53:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 409. [2025-03-04 10:53:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 278 states have (on average 1.5215827338129497) internal successors, (423), 385 states have internal predecessors, (423), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 467 transitions. [2025-03-04 10:53:10,634 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 467 transitions. Word has length 86 [2025-03-04 10:53:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:10,635 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 467 transitions. [2025-03-04 10:53:10,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 28.666666666666668) internal successors, (172), 7 states have internal predecessors, (172), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:10,635 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 467 transitions. [2025-03-04 10:53:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:53:10,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:10,636 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:10,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:10,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:53:10,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:10,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1503557041, now seen corresponding path program 1 times [2025-03-04 10:53:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-03-04 10:53:10,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:10,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427864267] [2025-03-04 10:53:10,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:53:10,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:53:10,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:53:10,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:10,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-03-04 10:53:11,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427864267] [2025-03-04 10:53:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427864267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:11,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:53:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105338790] [2025-03-04 10:53:11,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:11,122 INFO L87 Difference]: Start difference. First operand 409 states and 467 transitions. Second operand has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,279 INFO L93 Difference]: Finished difference Result 612 states and 644 transitions. [2025-03-04 10:53:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 97 [2025-03-04 10:53:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,282 INFO L225 Difference]: With dead ends: 612 [2025-03-04 10:53:11,282 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 10:53:11,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:11,283 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1094 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 784 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 10:53:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 414. [2025-03-04 10:53:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 286 states have (on average 1.479020979020979) internal successors, (423), 389 states have internal predecessors, (423), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:53:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 469 transitions. [2025-03-04 10:53:11,295 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 469 transitions. Word has length 97 [2025-03-04 10:53:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,295 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 469 transitions. [2025-03-04 10:53:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 469 transitions. [2025-03-04 10:53:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:53:11,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,297 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:11,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:53:11,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:11,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1039189943, now seen corresponding path program 1 times [2025-03-04 10:53:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969483769] [2025-03-04 10:53:11,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:11,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969483769] [2025-03-04 10:53:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969483769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:11,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:53:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98674607] [2025-03-04 10:53:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:11,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:11,656 INFO L87 Difference]: Start difference. First operand 414 states and 469 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,793 INFO L93 Difference]: Finished difference Result 420 states and 472 transitions. [2025-03-04 10:53:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2025-03-04 10:53:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,795 INFO L225 Difference]: With dead ends: 420 [2025-03-04 10:53:11,795 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 10:53:11,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:11,796 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 456 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 400 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 10:53:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-04 10:53:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 268 states have (on average 1.5037313432835822) internal successors, (403), 371 states have internal predecessors, (403), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 10:53:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 445 transitions. [2025-03-04 10:53:11,808 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 445 transitions. Word has length 103 [2025-03-04 10:53:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,808 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 445 transitions. [2025-03-04 10:53:11,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 445 transitions. [2025-03-04 10:53:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 10:53:11,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,809 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:53:11,809 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1503437932, now seen corresponding path program 1 times [2025-03-04 10:53:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903792960] [2025-03-04 10:53:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:11,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:11,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:11,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230716010] [2025-03-04 10:53:11,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:11,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:11,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:53:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 10:53:11,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 10:53:11,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:11,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:12,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903792960] [2025-03-04 10:53:12,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230716010] [2025-03-04 10:53:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230716010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:12,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:12,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967945951] [2025-03-04 10:53:12,275 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:12,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:12,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:12,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:12,277 INFO L87 Difference]: Start difference. First operand 394 states and 445 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:12,824 INFO L93 Difference]: Finished difference Result 522 states and 610 transitions. [2025-03-04 10:53:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2025-03-04 10:53:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:12,826 INFO L225 Difference]: With dead ends: 522 [2025-03-04 10:53:12,826 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 10:53:12,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:12,826 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 133 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:12,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 405 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 10:53:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 479. [2025-03-04 10:53:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 348 states have (on average 1.5114942528735633) internal successors, (526), 451 states have internal predecessors, (526), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 578 transitions. [2025-03-04 10:53:12,839 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 578 transitions. Word has length 118 [2025-03-04 10:53:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 578 transitions. [2025-03-04 10:53:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 578 transitions. [2025-03-04 10:53:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 10:53:12,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:12,841 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:12,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:53:13,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 638064583, now seen corresponding path program 1 times [2025-03-04 10:53:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-04 10:53:13,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:13,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:13,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:13,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186898954] [2025-03-04 10:53:13,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:13,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:13,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:13,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:53:13,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 10:53:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 10:53:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:13,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:13,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:13,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-04 10:53:13,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186898954] [2025-03-04 10:53:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186898954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:13,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846491523] [2025-03-04 10:53:13,869 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:13,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:13,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:13,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:13,870 INFO L87 Difference]: Start difference. First operand 479 states and 578 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:14,424 INFO L93 Difference]: Finished difference Result 513 states and 585 transitions. [2025-03-04 10:53:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 119 [2025-03-04 10:53:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:14,426 INFO L225 Difference]: With dead ends: 513 [2025-03-04 10:53:14,426 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 10:53:14,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:14,427 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 131 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:14,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 398 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 10:53:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 479. [2025-03-04 10:53:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 348 states have (on average 1.4655172413793103) internal successors, (510), 451 states have internal predecessors, (510), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 562 transitions. [2025-03-04 10:53:14,437 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 562 transitions. Word has length 119 [2025-03-04 10:53:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 562 transitions. [2025-03-04 10:53:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 562 transitions. [2025-03-04 10:53:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 10:53:14,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:14,438 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:14,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:14,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,639 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:14,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1694834190, now seen corresponding path program 1 times [2025-03-04 10:53:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477664705] [2025-03-04 10:53:14,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:14,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:14,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477664705] [2025-03-04 10:53:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477664705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:14,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247873563] [2025-03-04 10:53:14,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:14,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:14,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:53:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:53:14,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:53:14,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:14,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247873563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:15,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687055374] [2025-03-04 10:53:15,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:15,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:15,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:15,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:15,078 INFO L87 Difference]: Start difference. First operand 479 states and 562 transitions. Second operand has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:15,562 INFO L93 Difference]: Finished difference Result 497 states and 569 transitions. [2025-03-04 10:53:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 120 [2025-03-04 10:53:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:15,564 INFO L225 Difference]: With dead ends: 497 [2025-03-04 10:53:15,564 INFO L226 Difference]: Without dead ends: 492 [2025-03-04 10:53:15,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:15,565 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 336 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:15,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 601 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-04 10:53:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 475. [2025-03-04 10:53:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 348 states have (on average 1.4396551724137931) internal successors, (501), 447 states have internal predecessors, (501), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 553 transitions. [2025-03-04 10:53:15,576 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 553 transitions. Word has length 120 [2025-03-04 10:53:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:15,576 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 553 transitions. [2025-03-04 10:53:15,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 8 states have internal predecessors, (214), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 553 transitions. [2025-03-04 10:53:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:53:15,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:15,577 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:15,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:15,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:15,778 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:15,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1000252123, now seen corresponding path program 1 times [2025-03-04 10:53:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:15,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608132721] [2025-03-04 10:53:15,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:15,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608132721] [2025-03-04 10:53:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608132721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689180708] [2025-03-04 10:53:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:15,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:15,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:53:15,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:53:15,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:53:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:15,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:16,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689180708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:16,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:16,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:16,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326601544] [2025-03-04 10:53:16,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:16,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:16,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:16,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:16,188 INFO L87 Difference]: Start difference. First operand 475 states and 553 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:16,576 INFO L93 Difference]: Finished difference Result 493 states and 560 transitions. [2025-03-04 10:53:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 121 [2025-03-04 10:53:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:16,578 INFO L225 Difference]: With dead ends: 493 [2025-03-04 10:53:16,578 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 10:53:16,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:16,579 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 334 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:16,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 472 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 10:53:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 471. [2025-03-04 10:53:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 348 states have (on average 1.4137931034482758) internal successors, (492), 443 states have internal predecessors, (492), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 544 transitions. [2025-03-04 10:53:16,589 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 544 transitions. Word has length 121 [2025-03-04 10:53:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 544 transitions. [2025-03-04 10:53:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 544 transitions. [2025-03-04 10:53:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 10:53:16,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:16,590 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:16,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:16,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:16,794 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash -943044528, now seen corresponding path program 1 times [2025-03-04 10:53:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:16,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821349225] [2025-03-04 10:53:16,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:16,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:16,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:16,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:16,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390537241] [2025-03-04 10:53:16,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:16,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:16,813 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:53:16,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 10:53:16,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:53:16,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:16,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:16,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:16,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:17,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821349225] [2025-03-04 10:53:17,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:17,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390537241] [2025-03-04 10:53:17,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390537241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:17,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685913612] [2025-03-04 10:53:17,334 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:17,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:17,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:17,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:17,336 INFO L87 Difference]: Start difference. First operand 471 states and 544 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:17,799 INFO L93 Difference]: Finished difference Result 492 states and 551 transitions. [2025-03-04 10:53:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2025-03-04 10:53:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:17,801 INFO L225 Difference]: With dead ends: 492 [2025-03-04 10:53:17,801 INFO L226 Difference]: Without dead ends: 477 [2025-03-04 10:53:17,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 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-04 10:53:17,805 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 114 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:17,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 392 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-04 10:53:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-03-04 10:53:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 351 states have (on average 1.376068376068376) internal successors, (483), 446 states have internal predecessors, (483), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 535 transitions. [2025-03-04 10:53:17,816 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 535 transitions. Word has length 122 [2025-03-04 10:53:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:17,817 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 535 transitions. [2025-03-04 10:53:17,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 535 transitions. [2025-03-04 10:53:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 10:53:17,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:17,818 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:17,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:18,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:53:18,018 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:18,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 830390915, now seen corresponding path program 1 times [2025-03-04 10:53:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060581660] [2025-03-04 10:53:18,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:18,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060581660] [2025-03-04 10:53:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060581660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928372088] [2025-03-04 10:53:18,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:18,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:18,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:53:18,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 10:53:18,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:53:18,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:18,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:18,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928372088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:18,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:18,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2025-03-04 10:53:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746368710] [2025-03-04 10:53:18,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:18,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:18,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:18,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:18,394 INFO L87 Difference]: Start difference. First operand 474 states and 535 transitions. Second operand has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:19,387 INFO L93 Difference]: Finished difference Result 490 states and 536 transitions. [2025-03-04 10:53:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-04 10:53:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:19,388 INFO L225 Difference]: With dead ends: 490 [2025-03-04 10:53:19,389 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 10:53:19,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:19,389 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 172 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:19,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 665 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:53:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 10:53:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 474. [2025-03-04 10:53:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 351 states have (on average 1.3703703703703705) internal successors, (481), 446 states have internal predecessors, (481), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 533 transitions. [2025-03-04 10:53:19,399 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 533 transitions. Word has length 123 [2025-03-04 10:53:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:19,399 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 533 transitions. [2025-03-04 10:53:19,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 8 states have internal predecessors, (145), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 533 transitions. [2025-03-04 10:53:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 10:53:19,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:19,400 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:19,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:53:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:53:19,601 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -135926465, now seen corresponding path program 1 times [2025-03-04 10:53:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520539177] [2025-03-04 10:53:19,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:19,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:19,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:19,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:19,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520539177] [2025-03-04 10:53:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520539177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437620837] [2025-03-04 10:53:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:19,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:19,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:19,676 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:53:19,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:19,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:19,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:19,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:19,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:19,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:20,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437620837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:20,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-04 10:53:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534353665] [2025-03-04 10:53:20,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:20,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:20,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:20,088 INFO L87 Difference]: Start difference. First operand 474 states and 533 transitions. Second operand has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:21,277 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2025-03-04 10:53:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:21,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2025-03-04 10:53:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:21,279 INFO L225 Difference]: With dead ends: 474 [2025-03-04 10:53:21,279 INFO L226 Difference]: Without dead ends: 446 [2025-03-04 10:53:21,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:21,279 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 495 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:21,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 302 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 10:53:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-04 10:53:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-04 10:53:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 351 states have (on average 1.2763532763532763) internal successors, (448), 418 states have internal predecessors, (448), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 500 transitions. [2025-03-04 10:53:21,289 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 500 transitions. Word has length 127 [2025-03-04 10:53:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:21,289 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 500 transitions. [2025-03-04 10:53:21,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 21.75) internal successors, (174), 9 states have internal predecessors, (174), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 500 transitions. [2025-03-04 10:53:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 10:53:21,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:21,290 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:21,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:53:21,491 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1929537541, now seen corresponding path program 1 times [2025-03-04 10:53:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-03-04 10:53:21,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:21,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594460116] [2025-03-04 10:53:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594460116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758491922] [2025-03-04 10:53:21,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:21,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:21,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:21,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:53:21,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 10:53:21,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 10:53:21,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:21,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:21,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:22,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758491922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:22,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-04 10:53:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864419849] [2025-03-04 10:53:22,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:22,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:22,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:22,890 INFO L87 Difference]: Start difference. First operand 446 states and 500 transitions. Second operand has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:23,867 INFO L93 Difference]: Finished difference Result 446 states and 500 transitions. [2025-03-04 10:53:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2025-03-04 10:53:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:23,869 INFO L225 Difference]: With dead ends: 446 [2025-03-04 10:53:23,869 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 10:53:23,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:53:23,870 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 349 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:23,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 533 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 10:53:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-04 10:53:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.256965944272446) internal successors, (406), 380 states have internal predecessors, (406), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 454 transitions. [2025-03-04 10:53:23,879 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 454 transitions. Word has length 131 [2025-03-04 10:53:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:23,879 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 454 transitions. [2025-03-04 10:53:23,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.2) internal successors, (182), 11 states have internal predecessors, (182), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 454 transitions. [2025-03-04 10:53:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:53:23,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:23,880 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:23,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:53:24,081 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1915178913, now seen corresponding path program 1 times [2025-03-04 10:53:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419519828] [2025-03-04 10:53:24,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 10:53:24,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:53:24,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:24,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 10:53:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419519828] [2025-03-04 10:53:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419519828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081090508] [2025-03-04 10:53:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:24,137 INFO L87 Difference]: Start difference. First operand 406 states and 454 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:24,344 INFO L93 Difference]: Finished difference Result 406 states and 454 transitions. [2025-03-04 10:53:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 160 [2025-03-04 10:53:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:24,346 INFO L225 Difference]: With dead ends: 406 [2025-03-04 10:53:24,346 INFO L226 Difference]: Without dead ends: 405 [2025-03-04 10:53:24,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:24,346 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 272 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:24,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 182 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-04 10:53:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-04 10:53:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 323 states have (on average 1.2507739938080495) internal successors, (404), 379 states have internal predecessors, (404), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 452 transitions. [2025-03-04 10:53:24,357 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 452 transitions. Word has length 160 [2025-03-04 10:53:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 452 transitions. [2025-03-04 10:53:24,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 452 transitions. [2025-03-04 10:53:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 10:53:24,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:24,358 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:24,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:53:24,359 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1934104488, now seen corresponding path program 1 times [2025-03-04 10:53:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907273919] [2025-03-04 10:53:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:24,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:53:24,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:53:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907273919] [2025-03-04 10:53:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907273919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666586823] [2025-03-04 10:53:24,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:24,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:24,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:24,436 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:24,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:53:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 10:53:24,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 10:53:24,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:24,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:24,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:24,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666586823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:24,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:53:24,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904697849] [2025-03-04 10:53:24,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:24,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:24,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:24,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:24,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:24,732 INFO L87 Difference]: Start difference. First operand 405 states and 452 transitions. Second operand has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:24,996 INFO L93 Difference]: Finished difference Result 434 states and 461 transitions. [2025-03-04 10:53:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:24,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 167 [2025-03-04 10:53:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:24,998 INFO L225 Difference]: With dead ends: 434 [2025-03-04 10:53:24,998 INFO L226 Difference]: Without dead ends: 432 [2025-03-04 10:53:24,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:24,998 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 715 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:24,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 623 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-04 10:53:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 403. [2025-03-04 10:53:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.238390092879257) internal successors, (400), 377 states have internal predecessors, (400), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 448 transitions. [2025-03-04 10:53:25,007 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 448 transitions. Word has length 167 [2025-03-04 10:53:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:25,008 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 448 transitions. [2025-03-04 10:53:25,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 34.25) internal successors, (274), 9 states have internal predecessors, (274), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 448 transitions. [2025-03-04 10:53:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:53:25,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:25,009 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:25,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:25,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:25,209 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:25,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash -172302884, now seen corresponding path program 1 times [2025-03-04 10:53:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460059700] [2025-03-04 10:53:25,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:25,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:25,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:25,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834259914] [2025-03-04 10:53:25,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:25,231 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:25,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:53:25,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 10:53:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:53:25,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:25,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:25,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:25,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460059700] [2025-03-04 10:53:25,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834259914] [2025-03-04 10:53:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834259914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:25,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:25,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:53:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660372155] [2025-03-04 10:53:25,829 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:25,831 INFO L87 Difference]: Start difference. First operand 403 states and 448 transitions. Second operand has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 10:53:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:26,209 INFO L93 Difference]: Finished difference Result 415 states and 448 transitions. [2025-03-04 10:53:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:26,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 168 [2025-03-04 10:53:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:26,211 INFO L225 Difference]: With dead ends: 415 [2025-03-04 10:53:26,211 INFO L226 Difference]: Without dead ends: 409 [2025-03-04 10:53:26,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:26,211 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 114 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:26,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 664 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-04 10:53:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2025-03-04 10:53:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2198142414860682) internal successors, (394), 377 states have internal predecessors, (394), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 442 transitions. [2025-03-04 10:53:26,220 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 442 transitions. Word has length 168 [2025-03-04 10:53:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:26,221 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 442 transitions. [2025-03-04 10:53:26,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 10:53:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 442 transitions. [2025-03-04 10:53:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 10:53:26,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:26,221 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:26,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:53:26,422 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:26,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1084385192, now seen corresponding path program 1 times [2025-03-04 10:53:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824111771] [2025-03-04 10:53:26,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:26,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:26,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:26,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:26,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590647788] [2025-03-04 10:53:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:26,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:26,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:26,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:26,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:53:26,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 10:53:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 10:53:26,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:26,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:53:26,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:27,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824111771] [2025-03-04 10:53:28,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590647788] [2025-03-04 10:53:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590647788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:28,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 10:53:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154692351] [2025-03-04 10:53:28,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:28,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:28,057 INFO L87 Difference]: Start difference. First operand 403 states and 442 transitions. Second operand has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:30,029 INFO L93 Difference]: Finished difference Result 408 states and 442 transitions. [2025-03-04 10:53:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:53:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 172 [2025-03-04 10:53:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:30,031 INFO L225 Difference]: With dead ends: 408 [2025-03-04 10:53:30,031 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 10:53:30,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:53:30,031 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 519 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:30,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 307 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 10:53:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 10:53:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 403. [2025-03-04 10:53:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2074303405572755) internal successors, (390), 377 states have internal predecessors, (390), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:53:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 438 transitions. [2025-03-04 10:53:30,046 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 438 transitions. Word has length 172 [2025-03-04 10:53:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:30,047 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 438 transitions. [2025-03-04 10:53:30,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 23.6) internal successors, (236), 11 states have internal predecessors, (236), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 438 transitions. [2025-03-04 10:53:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 10:53:30,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:30,048 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:30,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:53:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:53:30,250 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:30,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -153949247, now seen corresponding path program 1 times [2025-03-04 10:53:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644142359] [2025-03-04 10:53:30,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:30,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230337535] [2025-03-04 10:53:30,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:30,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:30,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:30,272 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:30,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:53:30,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 10:53:30,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 10:53:30,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:30,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:30,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:53:30,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:30,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644142359] [2025-03-04 10:53:31,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230337535] [2025-03-04 10:53:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230337535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:31,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-03-04 10:53:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463236893] [2025-03-04 10:53:31,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:53:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:31,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:53:31,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:53:31,499 INFO L87 Difference]: Start difference. First operand 403 states and 438 transitions. Second operand has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 10:53:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:32,555 INFO L93 Difference]: Finished difference Result 473 states and 536 transitions. [2025-03-04 10:53:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:53:32,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 191 [2025-03-04 10:53:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:32,556 INFO L225 Difference]: With dead ends: 473 [2025-03-04 10:53:32,556 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 10:53:32,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:53:32,557 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 453 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:32,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 241 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:53:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 10:53:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2025-03-04 10:53:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.2323759791122715) internal successors, (472), 437 states have internal predecessors, (472), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 532 transitions. [2025-03-04 10:53:32,570 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 532 transitions. Word has length 191 [2025-03-04 10:53:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:32,571 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 532 transitions. [2025-03-04 10:53:32,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 18.714285714285715) internal successors, (262), 15 states have internal predecessors, (262), 7 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-04 10:53:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 532 transitions. [2025-03-04 10:53:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:53:32,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:32,572 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:32,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:53:32,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:32,772 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:32,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -477459268, now seen corresponding path program 1 times [2025-03-04 10:53:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036741187] [2025-03-04 10:53:32,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:32,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:32,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:32,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:32,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036741187] [2025-03-04 10:53:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036741187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020376185] [2025-03-04 10:53:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:32,910 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:53:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:32,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:32,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:32,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:32,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:32,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:33,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020376185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:33,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-03-04 10:53:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74122722] [2025-03-04 10:53:33,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:33,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:53:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:33,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:53:33,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:33,352 INFO L87 Difference]: Start difference. First operand 469 states and 532 transitions. Second operand has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 10:53:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,417 INFO L93 Difference]: Finished difference Result 469 states and 532 transitions. [2025-03-04 10:53:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:34,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 192 [2025-03-04 10:53:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,419 INFO L225 Difference]: With dead ends: 469 [2025-03-04 10:53:34,419 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 10:53:34,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:53:34,419 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 372 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 243 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:53:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 10:53:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 10:53:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.2114882506527416) internal successors, (464), 433 states have internal predecessors, (464), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 524 transitions. [2025-03-04 10:53:34,439 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 524 transitions. Word has length 192 [2025-03-04 10:53:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,440 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 524 transitions. [2025-03-04 10:53:34,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 26.4) internal successors, (264), 11 states have internal predecessors, (264), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 10:53:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 524 transitions. [2025-03-04 10:53:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:53:34,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:34,441 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:34,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:53:34,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,643 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 14131833, now seen corresponding path program 1 times [2025-03-04 10:53:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91763040] [2025-03-04 10:53:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:34,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:34,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:34,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296710822] [2025-03-04 10:53:34,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:34,663 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:34,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:53:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 10:53:34,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:53:34,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:34,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:34,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:34,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:34,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91763040] [2025-03-04 10:53:34,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296710822] [2025-03-04 10:53:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296710822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:34,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:34,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443850111] [2025-03-04 10:53:34,885 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:34,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:34,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:34,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:34,886 INFO L87 Difference]: Start difference. First operand 465 states and 524 transitions. Second operand has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:34,981 INFO L93 Difference]: Finished difference Result 584 states and 616 transitions. [2025-03-04 10:53:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 192 [2025-03-04 10:53:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:34,982 INFO L225 Difference]: With dead ends: 584 [2025-03-04 10:53:34,982 INFO L226 Difference]: Without dead ends: 583 [2025-03-04 10:53:34,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:34,983 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 289 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:34,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 694 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-04 10:53:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 465. [2025-03-04 10:53:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.2088772845953002) internal successors, (463), 433 states have internal predecessors, (463), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 523 transitions. [2025-03-04 10:53:34,999 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 523 transitions. Word has length 192 [2025-03-04 10:53:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:34,999 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 523 transitions. [2025-03-04 10:53:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.75) internal successors, (135), 5 states have internal predecessors, (135), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 523 transitions. [2025-03-04 10:53:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 10:53:35,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:35,001 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:35,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:35,202 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:35,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -840399496, now seen corresponding path program 1 times [2025-03-04 10:53:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263487986] [2025-03-04 10:53:35,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:35,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 10:53:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:53:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187445016] [2025-03-04 10:53:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:35,226 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:35,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:53:35,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 10:53:35,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 10:53:35,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:35,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:35,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:53:35,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:53:35,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263487986] [2025-03-04 10:53:37,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187445016] [2025-03-04 10:53:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187445016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:37,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:53:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783238362] [2025-03-04 10:53:37,100 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:37,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:53:37,101 INFO L87 Difference]: Start difference. First operand 465 states and 523 transitions. Second operand has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:37,662 INFO L93 Difference]: Finished difference Result 467 states and 523 transitions. [2025-03-04 10:53:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:53:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 196 [2025-03-04 10:53:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:37,664 INFO L225 Difference]: With dead ends: 467 [2025-03-04 10:53:37,664 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 10:53:37,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:37,664 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 84 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:37,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 312 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 10:53:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 10:53:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 383 states have (on average 1.2036553524804177) internal successors, (461), 433 states have internal predecessors, (461), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 521 transitions. [2025-03-04 10:53:37,677 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 521 transitions. Word has length 196 [2025-03-04 10:53:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:37,678 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 521 transitions. [2025-03-04 10:53:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:53:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 521 transitions. [2025-03-04 10:53:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-04 10:53:37,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:37,679 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:37,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:53:37,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:53:37,879 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:37,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1244043865, now seen corresponding path program 2 times [2025-03-04 10:53:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:37,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873562262] [2025-03-04 10:53:37,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:37,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:37,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:53:37,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:53:37,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:37,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471825789] [2025-03-04 10:53:37,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:37,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:37,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:37,907 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:37,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:53:37,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 199 statements into 2 equivalence classes. [2025-03-04 10:53:37,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 10:53:37,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:37,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:37,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:53:37,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:38,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873562262] [2025-03-04 10:53:38,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471825789] [2025-03-04 10:53:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471825789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:38,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:53:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227931335] [2025-03-04 10:53:38,625 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:38,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:38,626 INFO L87 Difference]: Start difference. First operand 465 states and 521 transitions. Second operand has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:39,350 INFO L93 Difference]: Finished difference Result 548 states and 617 transitions. [2025-03-04 10:53:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:39,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 199 [2025-03-04 10:53:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:39,353 INFO L225 Difference]: With dead ends: 548 [2025-03-04 10:53:39,353 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 10:53:39,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:39,353 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:39,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 588 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:53:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 10:53:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2025-03-04 10:53:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 434 states have (on average 1.2027649769585254) internal successors, (522), 484 states have internal predecessors, (522), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:53:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 588 transitions. [2025-03-04 10:53:39,369 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 588 transitions. Word has length 199 [2025-03-04 10:53:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 588 transitions. [2025-03-04 10:53:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 10:53:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 588 transitions. [2025-03-04 10:53:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 10:53:39,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:39,370 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:39,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:53:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:53:39,570 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1525252919, now seen corresponding path program 2 times [2025-03-04 10:53:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535647914] [2025-03-04 10:53:39,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:39,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:53:39,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:53:39,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:39,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:39,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535647914] [2025-03-04 10:53:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535647914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:39,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282150006] [2025-03-04 10:53:39,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:39,689 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:39,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:53:39,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes. [2025-03-04 10:53:39,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 10:53:39,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:39,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:39,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:39,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:40,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282150006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:40,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:53:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458078469] [2025-03-04 10:53:40,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:40,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:53:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:40,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:53:40,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:40,214 INFO L87 Difference]: Start difference. First operand 519 states and 588 transitions. Second operand has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:40,783 INFO L93 Difference]: Finished difference Result 571 states and 638 transitions. [2025-03-04 10:53:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:53:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) Word has length 201 [2025-03-04 10:53:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:40,784 INFO L225 Difference]: With dead ends: 571 [2025-03-04 10:53:40,784 INFO L226 Difference]: Without dead ends: 570 [2025-03-04 10:53:40,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:53:40,785 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 813 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:40,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 539 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-04 10:53:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2025-03-04 10:53:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 464 states have (on average 1.1961206896551724) internal successors, (555), 514 states have internal predecessors, (555), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:53:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 627 transitions. [2025-03-04 10:53:40,804 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 627 transitions. Word has length 201 [2025-03-04 10:53:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:40,805 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 627 transitions. [2025-03-04 10:53:40,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 31.583333333333332) internal successors, (379), 13 states have internal predecessors, (379), 8 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 8 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-04 10:53:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 627 transitions. [2025-03-04 10:53:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:53:40,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:40,805 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:40,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:41,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:41,006 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:41,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 38200446, now seen corresponding path program 2 times [2025-03-04 10:53:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675455630] [2025-03-04 10:53:41,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:41,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:53:41,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:41,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176232934] [2025-03-04 10:53:41,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:41,026 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:41,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:53:41,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-04 10:53:41,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:53:41,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:41,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:53:41,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:41,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:53:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675455630] [2025-03-04 10:53:41,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176232934] [2025-03-04 10:53:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176232934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:41,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:53:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751938266] [2025-03-04 10:53:41,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:53:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:41,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:53:41,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:41,855 INFO L87 Difference]: Start difference. First operand 552 states and 627 transitions. Second operand has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:44,069 INFO L93 Difference]: Finished difference Result 593 states and 652 transitions. [2025-03-04 10:53:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:53:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 202 [2025-03-04 10:53:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:44,071 INFO L225 Difference]: With dead ends: 593 [2025-03-04 10:53:44,071 INFO L226 Difference]: Without dead ends: 458 [2025-03-04 10:53:44,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:53:44,071 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 909 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:44,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 978 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 10:53:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-04 10:53:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 444. [2025-03-04 10:53:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 364 states have (on average 1.1758241758241759) internal successors, (428), 412 states have internal predecessors, (428), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 488 transitions. [2025-03-04 10:53:44,085 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 488 transitions. Word has length 202 [2025-03-04 10:53:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:44,085 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 488 transitions. [2025-03-04 10:53:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.266666666666666) internal successors, (274), 16 states have internal predecessors, (274), 6 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 10:53:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 488 transitions. [2025-03-04 10:53:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 10:53:44,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:44,086 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 10:53:44,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:44,287 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:44,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash 138330569, now seen corresponding path program 1 times [2025-03-04 10:53:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327365165] [2025-03-04 10:53:44,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 10:53:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 10:53:44,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:44,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-04 10:53:44,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:44,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327365165] [2025-03-04 10:53:44,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327365165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970968231] [2025-03-04 10:53:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:44,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:44,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:44,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:44,351 INFO L87 Difference]: Start difference. First operand 444 states and 488 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:44,528 INFO L93 Difference]: Finished difference Result 444 states and 488 transitions. [2025-03-04 10:53:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 244 [2025-03-04 10:53:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:44,530 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:53:44,530 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 10:53:44,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:44,531 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 119 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:44,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 144 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 10:53:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-04 10:53:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 364 states have (on average 1.1703296703296704) internal successors, (426), 411 states have internal predecessors, (426), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 486 transitions. [2025-03-04 10:53:44,545 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 486 transitions. Word has length 244 [2025-03-04 10:53:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 486 transitions. [2025-03-04 10:53:44,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 486 transitions. [2025-03-04 10:53:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 10:53:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:44,547 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:44,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 10:53:44,547 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1032234614, now seen corresponding path program 2 times [2025-03-04 10:53:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295182668] [2025-03-04 10:53:44,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:44,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:53:44,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:53:44,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:44,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726697118] [2025-03-04 10:53:44,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:44,569 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:44,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:53:44,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-03-04 10:53:44,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 10:53:44,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:44,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:44,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-04 10:53:44,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295182668] [2025-03-04 10:53:44,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726697118] [2025-03-04 10:53:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726697118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692103663] [2025-03-04 10:53:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:44,995 INFO L87 Difference]: Start difference. First operand 443 states and 486 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:45,151 INFO L93 Difference]: Finished difference Result 443 states and 486 transitions. [2025-03-04 10:53:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:45,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 248 [2025-03-04 10:53:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:45,152 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:45,152 INFO L226 Difference]: Without dead ends: 442 [2025-03-04 10:53:45,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:45,153 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 226 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:45,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 267 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-04 10:53:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-04 10:53:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 364 states have (on average 1.164835164835165) internal successors, (424), 410 states have internal predecessors, (424), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 484 transitions. [2025-03-04 10:53:45,167 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 484 transitions. Word has length 248 [2025-03-04 10:53:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 484 transitions. [2025-03-04 10:53:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 10:53:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 484 transitions. [2025-03-04 10:53:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 10:53:45,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:45,168 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:45,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:45,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:53:45,369 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1934501832, now seen corresponding path program 1 times [2025-03-04 10:53:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042908729] [2025-03-04 10:53:45,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:45,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 10:53:45,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:53:45,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067673411] [2025-03-04 10:53:45,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:45,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:45,397 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:53:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 10:53:45,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 10:53:45,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:45,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:45,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:45,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:45,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042908729] [2025-03-04 10:53:46,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067673411] [2025-03-04 10:53:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067673411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:46,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:46,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-04 10:53:46,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252442863] [2025-03-04 10:53:46,047 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:46,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:46,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:46,048 INFO L87 Difference]: Start difference. First operand 442 states and 484 transitions. Second operand has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:53:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:46,343 INFO L93 Difference]: Finished difference Result 443 states and 484 transitions. [2025-03-04 10:53:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:53:46,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 249 [2025-03-04 10:53:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:46,344 INFO L225 Difference]: With dead ends: 443 [2025-03-04 10:53:46,344 INFO L226 Difference]: Without dead ends: 442 [2025-03-04 10:53:46,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:46,345 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 92 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:46,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 957 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:46,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-04 10:53:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-04 10:53:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 364 states have (on average 1.1620879120879122) internal successors, (423), 410 states have internal predecessors, (423), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:53:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 483 transitions. [2025-03-04 10:53:46,359 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 483 transitions. Word has length 249 [2025-03-04 10:53:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:46,359 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 483 transitions. [2025-03-04 10:53:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 8 states have internal predecessors, (172), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 10:53:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 483 transitions. [2025-03-04 10:53:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 10:53:46,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:46,360 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:46,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:46,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:53:46,561 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -872772346, now seen corresponding path program 2 times [2025-03-04 10:53:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549710649] [2025-03-04 10:53:46,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:46,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:53:46,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:53:46,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688733771] [2025-03-04 10:53:46,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:46,584 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:46,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:53:46,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-04 10:53:46,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 10:53:46,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:46,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:46,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:53:46,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:48,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549710649] [2025-03-04 10:53:49,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688733771] [2025-03-04 10:53:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688733771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:49,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2025-03-04 10:53:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520678707] [2025-03-04 10:53:49,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:49,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:53:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:49,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:53:49,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:53:49,129 INFO L87 Difference]: Start difference. First operand 442 states and 483 transitions. Second operand has 23 states, 22 states have (on average 15.727272727272727) internal successors, (346), 23 states have internal predecessors, (346), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:53:56,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:56,816 INFO L93 Difference]: Finished difference Result 489 states and 538 transitions. [2025-03-04 10:53:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:53:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 15.727272727272727) internal successors, (346), 23 states have internal predecessors, (346), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 252 [2025-03-04 10:53:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:56,818 INFO L225 Difference]: With dead ends: 489 [2025-03-04 10:53:56,818 INFO L226 Difference]: Without dead ends: 484 [2025-03-04 10:53:56,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:53:56,818 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 617 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 2881 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:56,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 293 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2881 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-04 10:53:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-04 10:53:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 481. [2025-03-04 10:53:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 400 states have (on average 1.165) internal successors, (466), 446 states have internal predecessors, (466), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:53:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 532 transitions. [2025-03-04 10:53:56,837 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 532 transitions. Word has length 252 [2025-03-04 10:53:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 532 transitions. [2025-03-04 10:53:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 15.727272727272727) internal successors, (346), 23 states have internal predecessors, (346), 8 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-04 10:53:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 532 transitions. [2025-03-04 10:53:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-04 10:53:56,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:56,838 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:53:56,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:53:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:53:57,039 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1808710063, now seen corresponding path program 1 times [2025-03-04 10:53:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003022011] [2025-03-04 10:53:57,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:53:57,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:53:57,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:57,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 113 proven. 106 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:53:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003022011] [2025-03-04 10:53:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003022011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167075984] [2025-03-04 10:53:57,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:57,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:57,206 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:57,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:53:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 10:53:57,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 10:53:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:57,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:57,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 10:53:57,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167075984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:57,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:57,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 10:53:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911534743] [2025-03-04 10:53:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:57,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:57,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:57,722 INFO L87 Difference]: Start difference. First operand 481 states and 532 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:57,836 INFO L93 Difference]: Finished difference Result 489 states and 535 transitions. [2025-03-04 10:53:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:57,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 261 [2025-03-04 10:53:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:57,837 INFO L225 Difference]: With dead ends: 489 [2025-03-04 10:53:57,837 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:53:57,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:57,837 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 96 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:57,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 373 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:53:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 10:53:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 196 states have (on average 1.0153061224489797) internal successors, (199), 199 states have internal predecessors, (199), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2025-03-04 10:53:57,845 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 261 [2025-03-04 10:53:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:57,845 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2025-03-04 10:53:57,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2025-03-04 10:53:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 10:53:57,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:57,846 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:57,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:53:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:58,051 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2125434353, now seen corresponding path program 1 times [2025-03-04 10:53:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002571648] [2025-03-04 10:53:58,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:58,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 10:53:58,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 10:53:58,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:58,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:53:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002571648] [2025-03-04 10:53:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002571648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:53:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224181562] [2025-03-04 10:53:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:58,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:58,152 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:53:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:58,366 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2025-03-04 10:53:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 275 [2025-03-04 10:53:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:58,367 INFO L225 Difference]: With dead ends: 218 [2025-03-04 10:53:58,367 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 10:53:58,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:58,368 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:58,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 340 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 10:53:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-03-04 10:53:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 197 states have internal predecessors, (197), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2025-03-04 10:53:58,376 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 275 [2025-03-04 10:53:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:58,376 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2025-03-04 10:53:58,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.6) internal successors, (193), 6 states have internal predecessors, (193), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 10:53:58,376 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2025-03-04 10:53:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 10:53:58,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:58,377 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 10:53:58,378 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2025-03-04 10:53:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1463955418, now seen corresponding path program 2 times [2025-03-04 10:53:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44230220] [2025-03-04 10:53:58,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:58,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-04 10:53:58,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:53:58,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:58,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:53:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:58,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44230220] [2025-03-04 10:53:58,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44230220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:58,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061970576] [2025-03-04 10:53:58,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:53:58,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:58,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:58,520 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:58,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:53:58,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-04 10:53:58,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:53:58,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:53:58,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:58,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:53:58,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:53:59,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:59,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061970576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:59,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2025-03-04 10:53:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880072456] [2025-03-04 10:53:59,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:59,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:53:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:59,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:53:59,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:53:59,976 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand has 14 states, 13 states have (on average 29.384615384615383) internal successors, (382), 14 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:00,667 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2025-03-04 10:54:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:00,668 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 29.384615384615383) internal successors, (382), 14 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 276 [2025-03-04 10:54:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:00,668 INFO L225 Difference]: With dead ends: 216 [2025-03-04 10:54:00,668 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:54:00,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:54:00,669 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 203 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:00,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 267 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:54:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:54:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:54:00,669 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-04 10:54:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:54:00,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2025-03-04 10:54:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:00,669 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:54:00,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 29.384615384615383) internal successors, (382), 14 states have internal predecessors, (382), 6 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-04 10:54:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:54:00,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:54:00,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2025-03-04 10:54:00,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2025-03-04 10:54:00,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2025-03-04 10:54:00,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2025-03-04 10:54:00,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2025-03-04 10:54:00,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2025-03-04 10:54:00,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2025-03-04 10:54:00,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2025-03-04 10:54:00,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:00,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:00,881 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:00,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:54:01,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:54:01,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:54:01 BoogieIcfgContainer [2025-03-04 10:54:01,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:54:01,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:54:01,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:54:01,375 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:54:01,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:53:03" (3/4) ... [2025-03-04 10:54:01,377 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:54:01,381 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:54:01,386 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 10:54:01,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:54:01,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:54:01,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:54:01,454 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:54:01,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:54:01,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:54:01,455 INFO L158 Benchmark]: Toolchain (without parser) took 58536.54ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 154.2MB in the beginning and 236.7MB in the end (delta: -82.5MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,455 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 118.6MB in the end (delta: 216.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:54:01,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.45ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 142.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.23ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,455 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 138.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:54:01,456 INFO L158 Benchmark]: IcfgBuilder took 663.09ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 100.3MB in the end (delta: 38.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,456 INFO L158 Benchmark]: TraceAbstraction took 57539.44ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 99.5MB in the beginning and 245.0MB in the end (delta: -145.5MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,456 INFO L158 Benchmark]: Witness Printer took 79.89ms. Allocated memory is still 352.3MB. Free memory was 245.0MB in the beginning and 236.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:01,461 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.25ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 118.6MB in the end (delta: 216.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.45ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 142.3MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.23ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 138.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 663.09ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 100.3MB in the end (delta: 38.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57539.44ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 99.5MB in the beginning and 245.0MB in the end (delta: -145.5MB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. * Witness Printer took 79.89ms. Allocated memory is still 352.3MB. Free memory was 245.0MB in the beginning and 236.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: 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 2 procedures, 302 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 57.0s, OverallIterations: 43, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12471 SdHoareTripleChecker+Valid, 26.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12220 mSDsluCounter, 18851 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11845 mSDsCounter, 839 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29685 IncrementalHoareTripleChecker+Invalid, 30524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 839 mSolverCounterUnsat, 7006 mSDtfsCounter, 29685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6901 GetRequests, 6562 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=35, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 945 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 10353 NumberOfCodeBlocks, 10353 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 9288 ConstructedInterpolants, 0 QuantifiedInterpolants, 58463 SizeOfPredicates, 24 NumberOfNonLiveVariables, 6831 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 65 InterpolantComputations, 20 PerfectInterpolantSequences, 13153/15840 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 138 specifications checked. All of them hold - InvariantResult [Line: 33]: Location Invariant Derived location invariant: ((((((((a <= 1) && (7 == y)) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) || ((((((a <= 1) && (y == 1)) && (n == 0)) && (0 <= a)) && (x == 0)) && (6 == z))) || (((((2 == n) && (a == 1)) && (x == 8)) && (19 == y)) && (z == 18))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:54:01,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE