./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/ps6-ll_valuebound20.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 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:41:25,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:41:25,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:41:25,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:41:25,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:41:25,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:41:25,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:41:25,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:41:25,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:41:25,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:41:25,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:41:25,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:41:25,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:41:25,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:41:25,701 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:41:25,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:41:25,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:41:25,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:41:25,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:41:25,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:41:25,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:41:25,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:41:25,703 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 -> 4b2ee659e7bd0f15011c822a777a938a0e6f5b3a8f826a051cccefa88973daa0 [2025-03-17 15:41:25,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:41:25,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:41:25,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:41:25,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:41:25,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:41:25,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-17 15:41:27,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627e368e5/45ffcf5e02774385b99006e6465dc565/FLAGe3fb45496 [2025-03-17 15:41:27,244 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:41:27,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound20.c [2025-03-17 15:41:27,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627e368e5/45ffcf5e02774385b99006e6465dc565/FLAGe3fb45496 [2025-03-17 15:41:27,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627e368e5/45ffcf5e02774385b99006e6465dc565 [2025-03-17 15:41:27,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:41:27,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:41:27,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:41:27,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:41:27,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:41:27,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e756c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27, skipping insertion in model container [2025-03-17 15:41:27,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:41:27,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:41:27,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:41:27,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:41:27,767 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:41:27,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27 WrapperNode [2025-03-17 15:41:27,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:41:27,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:41:27,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:41:27,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:41:27,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,808 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-17 15:41:27,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:41:27,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:41:27,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:41:27,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:41:27,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,832 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-17 15:41:27,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:41:27,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:41:27,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:41:27,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:41:27,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (1/1) ... [2025-03-17 15:41:27,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:41:27,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:41:27,871 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-17 15:41:27,877 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-17 15:41:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:41:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:41:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:41:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:41:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:41:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:41:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:41:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:41:27,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:41:27,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:41:28,310 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-17 15:41:28,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:41:28,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:41:28,326 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:41:28,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:41:28 BoogieIcfgContainer [2025-03-17 15:41:28,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:41:28,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:41:28,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:41:28,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:41:28,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:41:27" (1/3) ... [2025-03-17 15:41:28,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f2fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:41:28, skipping insertion in model container [2025-03-17 15:41:28,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:41:27" (2/3) ... [2025-03-17 15:41:28,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f2fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:41:28, skipping insertion in model container [2025-03-17 15:41:28,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:41:28" (3/3) ... [2025-03-17 15:41:28,333 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c [2025-03-17 15:41:28,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:41:28,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound20.c that has 3 procedures, 223 locations, 1 initial locations, 1 loop locations, and 102 error locations. [2025-03-17 15:41:28,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:41:28,396 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;@4f50865b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:41:28,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-17 15:41:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 113 states have (on average 1.9380530973451326) internal successors, (219), 215 states have internal predecessors, (219), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:41:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:41:28,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:28,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:28,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1900273073, now seen corresponding path program 1 times [2025-03-17 15:41:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157436121] [2025-03-17 15:41:28,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:41:28,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:41:28,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:28,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:41:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157436121] [2025-03-17 15:41:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157436121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:41:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679887040] [2025-03-17 15:41:28,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:28,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:41:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:41:28,489 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-17 15:41:28,491 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-17 15:41:28,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:41:28,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:41:28,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:28,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:28,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:41:28,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:41:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:41:28,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:41:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679887040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:41:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:41:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153364149] [2025-03-17 15:41:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:28,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:41:28,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:41:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:41:28,543 INFO L87 Difference]: Start difference. First operand has 223 states, 113 states have (on average 1.9380530973451326) internal successors, (219), 215 states have internal predecessors, (219), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:41:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:28,564 INFO L93 Difference]: Finished difference Result 419 states and 460 transitions. [2025-03-17 15:41:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:41:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2025-03-17 15:41:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:28,570 INFO L225 Difference]: With dead ends: 419 [2025-03-17 15:41:28,571 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 15:41:28,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-17 15:41:28,577 INFO L435 NwaCegarLoop]: 201 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, 201 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-17 15:41:28,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:41:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 15:41:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 15:41:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 111 states have (on average 1.6936936936936937) internal successors, (188), 187 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:41:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2025-03-17 15:41:28,606 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 13 [2025-03-17 15:41:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2025-03-17 15:41:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:41:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2025-03-17 15:41:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:41:28,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:28,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:28,614 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-17 15:41:28,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 15:41:28,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2095863057, now seen corresponding path program 1 times [2025-03-17 15:41:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444643567] [2025-03-17 15:41:28,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:28,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:41:28,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:41:28,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444643567] [2025-03-17 15:41:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444643567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:28,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:41:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377452185] [2025-03-17 15:41:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:41:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:28,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:41:28,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:41:28,881 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:29,240 INFO L93 Difference]: Finished difference Result 354 states and 362 transitions. [2025-03-17 15:41:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:41:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-17 15:41:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:29,242 INFO L225 Difference]: With dead ends: 354 [2025-03-17 15:41:29,242 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 15:41:29,243 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-17 15:41:29,243 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:29,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 135 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:41:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 15:41:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 284. [2025-03-17 15:41:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 200 states have (on average 1.435) internal successors, (287), 276 states have internal predecessors, (287), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:41:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 297 transitions. [2025-03-17 15:41:29,258 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 297 transitions. Word has length 13 [2025-03-17 15:41:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:29,259 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 297 transitions. [2025-03-17 15:41:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 297 transitions. [2025-03-17 15:41:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:41:29,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:29,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:41:29,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2066429559, now seen corresponding path program 1 times [2025-03-17 15:41:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827086784] [2025-03-17 15:41:29,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:41:29,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:41:29,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:29,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827086784] [2025-03-17 15:41:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827086784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:41:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842276517] [2025-03-17 15:41:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:41:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:41:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:41:29,381 INFO L87 Difference]: Start difference. First operand 284 states and 297 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:29,430 INFO L93 Difference]: Finished difference Result 308 states and 315 transitions. [2025-03-17 15:41:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:41:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-03-17 15:41:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:29,431 INFO L225 Difference]: With dead ends: 308 [2025-03-17 15:41:29,431 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 15:41:29,432 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-17 15:41:29,432 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:29,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 357 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:41:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 15:41:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2025-03-17 15:41:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 199 states have (on average 1.407035175879397) internal successors, (280), 275 states have internal predecessors, (280), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:41:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 290 transitions. [2025-03-17 15:41:29,448 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 290 transitions. Word has length 51 [2025-03-17 15:41:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:29,448 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 290 transitions. [2025-03-17 15:41:29,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 290 transitions. [2025-03-17 15:41:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:41:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:29,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:29,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:41:29,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1563912249, now seen corresponding path program 1 times [2025-03-17 15:41:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646444195] [2025-03-17 15:41:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:29,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:41:29,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:41:29,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646444195] [2025-03-17 15:41:29,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646444195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:29,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:29,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:41:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221480104] [2025-03-17 15:41:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:29,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:41:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:29,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:41:29,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:41:29,566 INFO L87 Difference]: Start difference. First operand 283 states and 290 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:29,719 INFO L93 Difference]: Finished difference Result 303 states and 308 transitions. [2025-03-17 15:41:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:41:29,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-03-17 15:41:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:29,721 INFO L225 Difference]: With dead ends: 303 [2025-03-17 15:41:29,721 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 15:41:29,721 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-17 15:41:29,722 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 150 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:29,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 282 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:41:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 15:41:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2025-03-17 15:41:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 158 states have (on average 1.5) internal successors, (237), 234 states have internal predecessors, (237), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:41:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 247 transitions. [2025-03-17 15:41:29,728 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 247 transitions. Word has length 53 [2025-03-17 15:41:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 247 transitions. [2025-03-17 15:41:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:41:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 247 transitions. [2025-03-17 15:41:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:41:29,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:29,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:41:29,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:29,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 712457103, now seen corresponding path program 1 times [2025-03-17 15:41:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:29,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418439353] [2025-03-17 15:41:29,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:29,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:41:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:41:29,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:29,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418439353] [2025-03-17 15:41:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418439353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:29,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:41:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901482281] [2025-03-17 15:41:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:29,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:41:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:41:29,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:41:29,807 INFO L87 Difference]: Start difference. First operand 242 states and 247 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:29,821 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2025-03-17 15:41:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:41:29,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-03-17 15:41:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:29,822 INFO L225 Difference]: With dead ends: 244 [2025-03-17 15:41:29,823 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 15:41:29,823 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-17 15:41:29,823 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:29,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:41:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 15:41:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-17 15:41:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 158 states have (on average 1.4873417721518987) internal successors, (235), 234 states have internal predecessors, (235), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:41:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 245 transitions. [2025-03-17 15:41:29,829 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 245 transitions. Word has length 61 [2025-03-17 15:41:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:29,829 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 245 transitions. [2025-03-17 15:41:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 245 transitions. [2025-03-17 15:41:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:41:29,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:29,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:29,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:41:29,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1860806502, now seen corresponding path program 1 times [2025-03-17 15:41:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048821614] [2025-03-17 15:41:29,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:29,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:41:29,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:41:29,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:29,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:41:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087999064] [2025-03-17 15:41:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:41:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:41:29,859 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-17 15:41:29,861 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-17 15:41:29,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:41:29,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:41:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:29,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:41:29,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:41:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:29,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:41:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048821614] [2025-03-17 15:41:29,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:41:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087999064] [2025-03-17 15:41:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087999064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:41:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797715003] [2025-03-17 15:41:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:41:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:29,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:41:29,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:41:29,989 INFO L87 Difference]: Start difference. First operand 242 states and 245 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:30,347 INFO L93 Difference]: Finished difference Result 416 states and 429 transitions. [2025-03-17 15:41:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:41:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-03-17 15:41:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:30,348 INFO L225 Difference]: With dead ends: 416 [2025-03-17 15:41:30,348 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 15:41:30,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:41:30,350 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:30,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 155 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:41:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 15:41:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2025-03-17 15:41:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 335 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:41:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 364 transitions. [2025-03-17 15:41:30,359 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 364 transitions. Word has length 66 [2025-03-17 15:41:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:30,360 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 364 transitions. [2025-03-17 15:41:30,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 364 transitions. [2025-03-17 15:41:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:41:30,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:30,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:30,367 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-17 15:41:30,561 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,SelfDestructingSolverStorable5 [2025-03-17 15:41:30,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:30,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -878121021, now seen corresponding path program 1 times [2025-03-17 15:41:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852307902] [2025-03-17 15:41:30,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:30,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:41:30,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:41:30,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:30,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:30,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:30,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852307902] [2025-03-17 15:41:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852307902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:41:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187986817] [2025-03-17 15:41:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:30,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:41:30,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:30,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:41:30,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:41:30,631 INFO L87 Difference]: Start difference. First operand 345 states and 364 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:30,884 INFO L93 Difference]: Finished difference Result 346 states and 364 transitions. [2025-03-17 15:41:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:41:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2025-03-17 15:41:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:30,885 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:41:30,885 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 15:41:30,885 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-17 15:41:30,886 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 53 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:30,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 335 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:41:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 15:41:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 15:41:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 335 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:41:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 363 transitions. [2025-03-17 15:41:30,897 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 363 transitions. Word has length 73 [2025-03-17 15:41:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 363 transitions. [2025-03-17 15:41:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 363 transitions. [2025-03-17 15:41:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:41:30,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:30,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:41:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:41:30,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1451947810, now seen corresponding path program 1 times [2025-03-17 15:41:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198617911] [2025-03-17 15:41:30,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:30,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:41:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:41:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:30,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198617911] [2025-03-17 15:41:30,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198617911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:41:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:41:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:41:30,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053956903] [2025-03-17 15:41:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:41:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:41:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:30,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:41:30,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:41:30,979 INFO L87 Difference]: Start difference. First operand 345 states and 363 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:31,048 INFO L93 Difference]: Finished difference Result 346 states and 363 transitions. [2025-03-17 15:41:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:41:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2025-03-17 15:41:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:31,051 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:41:31,051 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 15:41:31,051 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-17 15:41:31,051 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:31,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 324 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:41:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 15:41:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 15:41:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3436293436293436) internal successors, (348), 335 states have internal predecessors, (348), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:41:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 362 transitions. [2025-03-17 15:41:31,061 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 362 transitions. Word has length 74 [2025-03-17 15:41:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:31,061 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 362 transitions. [2025-03-17 15:41:31,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:41:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 362 transitions. [2025-03-17 15:41:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 15:41:31,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:31,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 15:41:31,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:41:31,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:31,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash 654216814, now seen corresponding path program 1 times [2025-03-17 15:41:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:31,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488863129] [2025-03-17 15:41:31,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:31,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:41:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:41:31,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:41:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769708784] [2025-03-17 15:41:31,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:41:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:41:31,092 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-17 15:41:31,093 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-17 15:41:31,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:41:31,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:41:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:31,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:41:31,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:41:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:31,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:41:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488863129] [2025-03-17 15:41:31,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:41:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769708784] [2025-03-17 15:41:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769708784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:41:31,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:41:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-17 15:41:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84256180] [2025-03-17 15:41:31,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:41:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:41:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:31,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:41:31,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:41:31,596 INFO L87 Difference]: Start difference. First operand 345 states and 362 transitions. Second operand has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:41:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:41:32,748 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2025-03-17 15:41:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:41:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 113 [2025-03-17 15:41:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:41:32,749 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:41:32,750 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 15:41:32,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:41:32,751 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 341 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:41:32,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 173 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 15:41:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 15:41:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 349. [2025-03-17 15:41:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 266 states have (on average 1.3120300751879699) internal successors, (349), 339 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:41:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 363 transitions. [2025-03-17 15:41:32,761 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 363 transitions. Word has length 113 [2025-03-17 15:41:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:41:32,761 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 363 transitions. [2025-03-17 15:41:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:41:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 363 transitions. [2025-03-17 15:41:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 15:41:32,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:41:32,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-17 15:41:32,768 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-17 15:41:32,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:41:32,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:41:32,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:41:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1637136236, now seen corresponding path program 1 times [2025-03-17 15:41:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:41:32,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239880248] [2025-03-17 15:41:32,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:41:32,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 15:41:32,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:41:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:41:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460939794] [2025-03-17 15:41:33,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:41:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:41:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:41:33,008 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-17 15:41:33,009 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-17 15:41:33,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 15:41:33,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:41:33,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:41:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:41:33,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:41:33,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:41:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:33,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:41:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:41:34,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:41:34,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239880248] [2025-03-17 15:41:34,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:41:34,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460939794] [2025-03-17 15:41:34,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460939794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:41:34,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:41:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-17 15:41:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997227637] [2025-03-17 15:41:34,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:41:34,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:41:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:41:34,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:41:34,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:41:34,169 INFO L87 Difference]: Start difference. First operand 349 states and 363 transitions. Second operand has 9 states, 8 states have (on average 25.625) internal successors, (205), 9 states have internal predecessors, (205), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:41:40,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:43,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:52,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:01,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:03,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:09,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:15,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:16,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:21,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:25,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:30,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:33,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:37,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:39,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:45,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:50,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:54,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:43:01,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:43:05,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:43:11,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []