./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound100.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 4d17ed8dd7de3007f02b2c3df3a75e1fbb5469b0133c538c149df8a118a565d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:15:27,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:15:27,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:15:27,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:15:27,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:15:27,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:15:27,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:15:27,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:15:27,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:15:27,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:15:27,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:15:27,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:15:27,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:15:27,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:15:27,754 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:15:27,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:15:27,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:15:27,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:15:27,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:15:27,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:15:27,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:15:27,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:15:27,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:15:27,758 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 -> 4d17ed8dd7de3007f02b2c3df3a75e1fbb5469b0133c538c149df8a118a565d0 [2025-03-04 11:15:27,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:15:27,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:15:27,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:15:27,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:15:27,977 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:15:27,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2025-03-04 11:15:29,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e08174/272d16cb03ba4b95a8b9555fe9e616c0/FLAGbef88a94d [2025-03-04 11:15:29,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:15:29,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2025-03-04 11:15:29,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e08174/272d16cb03ba4b95a8b9555fe9e616c0/FLAGbef88a94d [2025-03-04 11:15:29,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e08174/272d16cb03ba4b95a8b9555fe9e616c0 [2025-03-04 11:15:29,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:15:29,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:15:29,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:15:29,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:15:29,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:15:29,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1451765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29, skipping insertion in model container [2025-03-04 11:15:29,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:15:29,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:15:29,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:15:29,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:15:29,824 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:15:29,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29 WrapperNode [2025-03-04 11:15:29,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:15:29,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:15:29,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:15:29,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:15:29,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,852 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2025-03-04 11:15:29,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:15:29,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:15:29,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:15:29,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:15:29,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:15:29,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:15:29,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:15:29,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:15:29,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:15:29,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (1/1) ... [2025-03-04 11:15:29,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:15:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:29,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:15:29,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:15:29,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:15:29,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:15:29,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:15:29,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:15:29,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:15:29,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:15:29,989 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:15:29,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:15:30,299 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 11:15:30,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:15:30,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:15:30,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:15:30,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:15:30 BoogieIcfgContainer [2025-03-04 11:15:30,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:15:30,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:15:30,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:15:30,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:15:30,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:15:29" (1/3) ... [2025-03-04 11:15:30,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb64bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:15:30, skipping insertion in model container [2025-03-04 11:15:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:15:29" (2/3) ... [2025-03-04 11:15:30,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb64bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:15:30, skipping insertion in model container [2025-03-04 11:15:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:15:30" (3/3) ... [2025-03-04 11:15:30,320 INFO L128 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound100.c [2025-03-04 11:15:30,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:15:30,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prod4br-ll_unwindbound100.c that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 44 error locations. [2025-03-04 11:15:30,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:15:30,379 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;@457908fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:15:30,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 11:15:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 62 states have (on average 1.8387096774193548) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:15:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:15:30,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:30,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:15:30,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:30,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash -154300386, now seen corresponding path program 1 times [2025-03-04 11:15:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892970143] [2025-03-04 11:15:30,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:30,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:15:30,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:15:30,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892970143] [2025-03-04 11:15:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892970143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:30,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:15:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695916319] [2025-03-04 11:15:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:30,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:15:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:30,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:15:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:15:30,513 INFO L87 Difference]: Start difference. First operand has 111 states, 62 states have (on average 1.8387096774193548) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:30,536 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2025-03-04 11:15:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:15:30,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:15:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:30,542 INFO L225 Difference]: With dead ends: 218 [2025-03-04 11:15:30,543 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:15:30,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:15:30,546 INFO L435 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:30,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:15:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:15:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 11:15:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 100 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2025-03-04 11:15:30,572 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 6 [2025-03-04 11:15:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:30,572 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2025-03-04 11:15:30,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2025-03-04 11:15:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:15:30,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:30,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:15:30,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:15:30,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:30,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -154270595, now seen corresponding path program 1 times [2025-03-04 11:15:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678186675] [2025-03-04 11:15:30,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:30,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:15:30,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:15:30,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:30,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:30,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:30,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678186675] [2025-03-04 11:15:30,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678186675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:15:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317949273] [2025-03-04 11:15:30,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:30,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:30,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:30,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:30,650 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:30,708 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2025-03-04 11:15:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:30,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:15:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:30,710 INFO L225 Difference]: With dead ends: 123 [2025-03-04 11:15:30,710 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:15:30,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:30,711 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:30,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:15:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:15:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 11:15:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 104 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-03-04 11:15:30,723 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 6 [2025-03-04 11:15:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-03-04 11:15:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-03-04 11:15:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:15:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:30,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:15:30,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -260219481, now seen corresponding path program 1 times [2025-03-04 11:15:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024557288] [2025-03-04 11:15:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:30,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:15:30,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:15:30,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:30,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:30,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050679848] [2025-03-04 11:15:30,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:30,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:30,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:30,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:15:30,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:15:30,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:15:30,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:30,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:30,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:15:30,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:30,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024557288] [2025-03-04 11:15:30,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050679848] [2025-03-04 11:15:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050679848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:15:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478006299] [2025-03-04 11:15:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:30,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:15:30,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:30,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:15:30,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:30,958 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:31,207 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2025-03-04 11:15:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:15:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 11:15:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:31,209 INFO L225 Difference]: With dead ends: 147 [2025-03-04 11:15:31,209 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 11:15:31,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:31,209 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 161 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:31,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 157 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 11:15:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2025-03-04 11:15:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 125 states have internal predecessors, (142), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:15:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2025-03-04 11:15:31,223 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 9 [2025-03-04 11:15:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:31,223 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2025-03-04 11:15:31,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2025-03-04 11:15:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:15:31,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:31,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:31,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:31,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:31,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:31,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash 523130745, now seen corresponding path program 1 times [2025-03-04 11:15:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:31,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575472344] [2025-03-04 11:15:31,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:31,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:15:31,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:15:31,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:31,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875029252] [2025-03-04 11:15:31,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:31,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:31,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:31,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:31,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:15:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:15:31,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:15:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:31,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:15:31,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:31,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575472344] [2025-03-04 11:15:31,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875029252] [2025-03-04 11:15:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875029252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:15:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947777760] [2025-03-04 11:15:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:15:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:31,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:15:31,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:31,563 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:31,785 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions. [2025-03-04 11:15:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:15:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:31,787 INFO L225 Difference]: With dead ends: 182 [2025-03-04 11:15:31,787 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:15:31,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:31,787 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 174 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:31,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 146 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:15:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-03-04 11:15:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.6306306306306306) internal successors, (181), 150 states have internal predecessors, (181), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:15:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2025-03-04 11:15:31,797 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 10 [2025-03-04 11:15:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:31,797 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2025-03-04 11:15:31,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2025-03-04 11:15:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:15:31,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:31,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:31,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:15:31,998 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,SelfDestructingSolverStorable3 [2025-03-04 11:15:31,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -962816027, now seen corresponding path program 1 times [2025-03-04 11:15:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384515997] [2025-03-04 11:15:31,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:32,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:15:32,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:15:32,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:32,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004526343] [2025-03-04 11:15:32,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:32,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:32,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:15:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:15:32,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:15:32,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:32,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:32,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:15:32,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:32,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384515997] [2025-03-04 11:15:32,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004526343] [2025-03-04 11:15:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004526343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:15:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156148518] [2025-03-04 11:15:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:15:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:15:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:32,171 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:32,331 INFO L93 Difference]: Finished difference Result 165 states and 198 transitions. [2025-03-04 11:15:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:15:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:32,332 INFO L225 Difference]: With dead ends: 165 [2025-03-04 11:15:32,332 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:15:32,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:32,333 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 145 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:32,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 164 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:15:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-03-04 11:15:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 150 states have internal predecessors, (180), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:15:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2025-03-04 11:15:32,346 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 11 [2025-03-04 11:15:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2025-03-04 11:15:32,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2025-03-04 11:15:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:15:32,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:32,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:32,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:32,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:32,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:32,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash 217474295, now seen corresponding path program 1 times [2025-03-04 11:15:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:32,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505977539] [2025-03-04 11:15:32,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:15:32,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:15:32,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077359515] [2025-03-04 11:15:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:32,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:32,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:32,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:15:32,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:15:32,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:15:32,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:32,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:32,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:15:32,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:32,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:32,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505977539] [2025-03-04 11:15:32,685 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:32,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077359515] [2025-03-04 11:15:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077359515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:32,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:32,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:15:32,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938311433] [2025-03-04 11:15:32,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:32,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:15:32,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:32,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:15:32,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:32,687 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:32,860 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2025-03-04 11:15:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:15:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:32,861 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:15:32,861 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 11:15:32,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:32,862 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 162 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:32,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 161 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 11:15:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-04 11:15:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5855855855855856) internal successors, (176), 150 states have internal predecessors, (176), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:15:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2025-03-04 11:15:32,872 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 12 [2025-03-04 11:15:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:32,872 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2025-03-04 11:15:32,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2025-03-04 11:15:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:15:32,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:32,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:32,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:15:33,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:33,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:33,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1848231389, now seen corresponding path program 1 times [2025-03-04 11:15:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055586568] [2025-03-04 11:15:33,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:33,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:15:33,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:15:33,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:33,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:33,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055586568] [2025-03-04 11:15:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055586568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834831328] [2025-03-04 11:15:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:33,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:33,151 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:33,444 INFO L93 Difference]: Finished difference Result 260 states and 306 transitions. [2025-03-04 11:15:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:33,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 11:15:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:33,445 INFO L225 Difference]: With dead ends: 260 [2025-03-04 11:15:33,445 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 11:15:33,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:33,447 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:33,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 183 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:15:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 11:15:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2025-03-04 11:15:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.5970149253731343) internal successors, (214), 173 states have internal predecessors, (214), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:15:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2025-03-04 11:15:33,458 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 13 [2025-03-04 11:15:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:33,458 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2025-03-04 11:15:33,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2025-03-04 11:15:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:15:33,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:33,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:33,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:15:33,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:33,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1460598155, now seen corresponding path program 1 times [2025-03-04 11:15:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704507836] [2025-03-04 11:15:33,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:33,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:15:33,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:15:33,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:33,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704507836] [2025-03-04 11:15:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704507836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830529073] [2025-03-04 11:15:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:33,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:33,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:33,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:33,513 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:33,955 INFO L93 Difference]: Finished difference Result 260 states and 304 transitions. [2025-03-04 11:15:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 11:15:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:33,960 INFO L225 Difference]: With dead ends: 260 [2025-03-04 11:15:33,960 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 11:15:33,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:33,961 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:33,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 189 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:15:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 11:15:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2025-03-04 11:15:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.5820895522388059) internal successors, (212), 173 states have internal predecessors, (212), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:15:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2025-03-04 11:15:33,972 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 14 [2025-03-04 11:15:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:33,972 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2025-03-04 11:15:33,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2025-03-04 11:15:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:15:33,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:33,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:33,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:15:33,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:33,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash 333870378, now seen corresponding path program 1 times [2025-03-04 11:15:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029684118] [2025-03-04 11:15:33,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:33,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:15:33,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:15:33,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:33,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029684118] [2025-03-04 11:15:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029684118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:15:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516589605] [2025-03-04 11:15:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:34,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:15:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:34,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:15:34,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:15:34,052 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:34,139 INFO L93 Difference]: Finished difference Result 259 states and 326 transitions. [2025-03-04 11:15:34,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:15:34,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 11:15:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:34,140 INFO L225 Difference]: With dead ends: 259 [2025-03-04 11:15:34,140 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 11:15:34,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:15:34,141 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 168 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-04 11:15:34,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 168 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 11:15:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2025-03-04 11:15:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 182 states have (on average 1.6538461538461537) internal successors, (301), 221 states have internal predecessors, (301), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:15:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 315 transitions. [2025-03-04 11:15:34,149 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 315 transitions. Word has length 28 [2025-03-04 11:15:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 315 transitions. [2025-03-04 11:15:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 315 transitions. [2025-03-04 11:15:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:15:34,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:34,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:15:34,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash 413023078, now seen corresponding path program 1 times [2025-03-04 11:15:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:34,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517879260] [2025-03-04 11:15:34,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:34,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:15:34,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:15:34,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:34,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4111780] [2025-03-04 11:15:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:34,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:34,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:34,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:15:34,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:15:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:15:34,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:34,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:34,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:15:34,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:34,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517879260] [2025-03-04 11:15:34,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4111780] [2025-03-04 11:15:34,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4111780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6746120] [2025-03-04 11:15:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:34,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:34,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:34,278 INFO L87 Difference]: Start difference. First operand 230 states and 315 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:34,441 INFO L93 Difference]: Finished difference Result 282 states and 387 transitions. [2025-03-04 11:15:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:34,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 11:15:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:34,442 INFO L225 Difference]: With dead ends: 282 [2025-03-04 11:15:34,442 INFO L226 Difference]: Without dead ends: 278 [2025-03-04 11:15:34,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:34,443 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 168 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:34,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-04 11:15:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 258. [2025-03-04 11:15:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 209 states have (on average 1.6555023923444976) internal successors, (346), 248 states have internal predecessors, (346), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 362 transitions. [2025-03-04 11:15:34,452 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 362 transitions. Word has length 28 [2025-03-04 11:15:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:34,453 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 362 transitions. [2025-03-04 11:15:34,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2025-03-04 11:15:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:15:34,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:34,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:34,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:15:34,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -145340384, now seen corresponding path program 1 times [2025-03-04 11:15:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463543076] [2025-03-04 11:15:34,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:34,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:15:34,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:15:34,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:34,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463543076] [2025-03-04 11:15:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463543076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065091549] [2025-03-04 11:15:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:34,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:34,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:34,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:34,703 INFO L87 Difference]: Start difference. First operand 258 states and 362 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:34,851 INFO L93 Difference]: Finished difference Result 342 states and 454 transitions. [2025-03-04 11:15:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 11:15:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:34,853 INFO L225 Difference]: With dead ends: 342 [2025-03-04 11:15:34,853 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 11:15:34,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:34,853 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 64 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:34,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 222 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 11:15:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 268. [2025-03-04 11:15:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 219 states have (on average 1.6484018264840183) internal successors, (361), 258 states have internal predecessors, (361), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 377 transitions. [2025-03-04 11:15:34,866 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 377 transitions. Word has length 29 [2025-03-04 11:15:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:34,867 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 377 transitions. [2025-03-04 11:15:34,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 377 transitions. [2025-03-04 11:15:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:15:34,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:34,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:34,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:15:34,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:34,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -81186459, now seen corresponding path program 1 times [2025-03-04 11:15:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364840641] [2025-03-04 11:15:34,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:34,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:15:34,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:15:34,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:34,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014341599] [2025-03-04 11:15:34,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:34,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:15:34,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:15:34,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:15:34,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:34,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:34,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:15:34,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:34,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364840641] [2025-03-04 11:15:34,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014341599] [2025-03-04 11:15:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014341599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:34,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:34,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563595775] [2025-03-04 11:15:34,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:34,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:34,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:34,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:34,974 INFO L87 Difference]: Start difference. First operand 268 states and 377 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:35,122 INFO L93 Difference]: Finished difference Result 285 states and 384 transitions. [2025-03-04 11:15:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 11:15:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:35,124 INFO L225 Difference]: With dead ends: 285 [2025-03-04 11:15:35,124 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 11:15:35,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:15:35,124 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 209 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:35,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 83 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 11:15:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2025-03-04 11:15:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 219 states have (on average 1.6255707762557077) internal successors, (356), 258 states have internal predecessors, (356), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 372 transitions. [2025-03-04 11:15:35,133 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 372 transitions. Word has length 29 [2025-03-04 11:15:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 372 transitions. [2025-03-04 11:15:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 372 transitions. [2025-03-04 11:15:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:15:35,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:35,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:35,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:15:35,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:35,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -210584613, now seen corresponding path program 1 times [2025-03-04 11:15:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737261170] [2025-03-04 11:15:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:35,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:15:35,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:15:35,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:35,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737261170] [2025-03-04 11:15:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737261170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29505359] [2025-03-04 11:15:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:35,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:35,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:35,425 INFO L87 Difference]: Start difference. First operand 268 states and 372 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:35,793 INFO L93 Difference]: Finished difference Result 342 states and 446 transitions. [2025-03-04 11:15:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:15:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:35,795 INFO L225 Difference]: With dead ends: 342 [2025-03-04 11:15:35,795 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 11:15:35,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:35,796 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:35,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:15:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 11:15:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 270. [2025-03-04 11:15:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.6199095022624435) internal successors, (358), 260 states have internal predecessors, (358), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 374 transitions. [2025-03-04 11:15:35,806 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 374 transitions. Word has length 30 [2025-03-04 11:15:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:35,807 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 374 transitions. [2025-03-04 11:15:35,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 374 transitions. [2025-03-04 11:15:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:15:35,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:35,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:15:35,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1778187076, now seen corresponding path program 1 times [2025-03-04 11:15:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170459185] [2025-03-04 11:15:35,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:35,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:15:35,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:15:35,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:35,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170459185] [2025-03-04 11:15:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170459185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:35,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:35,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859377981] [2025-03-04 11:15:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:35,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:35,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:35,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:35,864 INFO L87 Difference]: Start difference. First operand 270 states and 374 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:35,964 INFO L93 Difference]: Finished difference Result 342 states and 444 transitions. [2025-03-04 11:15:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:15:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:35,968 INFO L225 Difference]: With dead ends: 342 [2025-03-04 11:15:35,968 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 11:15:35,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:35,969 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:35,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 204 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 11:15:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 279. [2025-03-04 11:15:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 230 states have (on average 1.617391304347826) internal successors, (372), 269 states have internal predecessors, (372), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 388 transitions. [2025-03-04 11:15:35,976 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 388 transitions. Word has length 30 [2025-03-04 11:15:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 388 transitions. [2025-03-04 11:15:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 388 transitions. [2025-03-04 11:15:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:15:35,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:35,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:35,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:15:35,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1829719547, now seen corresponding path program 1 times [2025-03-04 11:15:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405809208] [2025-03-04 11:15:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:35,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:15:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:15:35,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:35,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405809208] [2025-03-04 11:15:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405809208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:36,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:15:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392829414] [2025-03-04 11:15:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:36,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:15:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:36,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:15:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:36,035 INFO L87 Difference]: Start difference. First operand 279 states and 388 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:36,321 INFO L93 Difference]: Finished difference Result 390 states and 563 transitions. [2025-03-04 11:15:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:15:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:15:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:36,326 INFO L225 Difference]: With dead ends: 390 [2025-03-04 11:15:36,326 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 11:15:36,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:15:36,327 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 286 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:36,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 93 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 11:15:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 285. [2025-03-04 11:15:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.6059322033898304) internal successors, (379), 275 states have internal predecessors, (379), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 395 transitions. [2025-03-04 11:15:36,335 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 395 transitions. Word has length 30 [2025-03-04 11:15:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:36,335 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 395 transitions. [2025-03-04 11:15:36,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 395 transitions. [2025-03-04 11:15:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:15:36,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:36,336 INFO L218 NwaCegarLoop]: trace histogram [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-04 11:15:36,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:15:36,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:36,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash -811840509, now seen corresponding path program 1 times [2025-03-04 11:15:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885299223] [2025-03-04 11:15:36,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:36,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:15:36,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:15:36,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:36,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:36,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:36,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885299223] [2025-03-04 11:15:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885299223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:36,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707768739] [2025-03-04 11:15:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:36,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:36,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:15:36,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:15:36,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:15:36,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:36,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:36,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:15:36,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:36,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707768739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:36,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:15:36,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 11:15:36,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435117943] [2025-03-04 11:15:36,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:36,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:15:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:36,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:15:36,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:15:36,490 INFO L87 Difference]: Start difference. First operand 285 states and 395 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:36,530 INFO L93 Difference]: Finished difference Result 285 states and 395 transitions. [2025-03-04 11:15:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:15:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 11:15:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:36,532 INFO L225 Difference]: With dead ends: 285 [2025-03-04 11:15:36,532 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 11:15:36,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:15:36,532 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 82 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:36,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 295 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:15:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 11:15:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-04 11:15:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 236 states have (on average 1.5847457627118644) internal successors, (374), 274 states have internal predecessors, (374), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 390 transitions. [2025-03-04 11:15:36,545 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 390 transitions. Word has length 31 [2025-03-04 11:15:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 390 transitions. [2025-03-04 11:15:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 390 transitions. [2025-03-04 11:15:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:15:36,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:36,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:36,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:36,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -710775485, now seen corresponding path program 1 times [2025-03-04 11:15:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941789035] [2025-03-04 11:15:36,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:36,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:15:36,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:15:36,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:36,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941789035] [2025-03-04 11:15:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941789035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314937819] [2025-03-04 11:15:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:36,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:36,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:36,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:36,791 INFO L87 Difference]: Start difference. First operand 284 states and 390 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:37,055 INFO L93 Difference]: Finished difference Result 340 states and 435 transitions. [2025-03-04 11:15:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 11:15:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:37,056 INFO L225 Difference]: With dead ends: 340 [2025-03-04 11:15:37,056 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 11:15:37,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:37,057 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:37,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 217 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:15:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 11:15:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 286. [2025-03-04 11:15:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 238 states have (on average 1.5798319327731092) internal successors, (376), 276 states have internal predecessors, (376), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 392 transitions. [2025-03-04 11:15:37,064 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 392 transitions. Word has length 31 [2025-03-04 11:15:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:37,065 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 392 transitions. [2025-03-04 11:15:37,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 392 transitions. [2025-03-04 11:15:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:15:37,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:37,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:15:37,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:37,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash 886731140, now seen corresponding path program 1 times [2025-03-04 11:15:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360942562] [2025-03-04 11:15:37,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:37,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:15:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:15:37,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:37,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360942562] [2025-03-04 11:15:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360942562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:37,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:37,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:15:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297635389] [2025-03-04 11:15:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:37,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:15:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:37,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:15:37,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:37,123 INFO L87 Difference]: Start difference. First operand 286 states and 392 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:37,375 INFO L93 Difference]: Finished difference Result 294 states and 399 transitions. [2025-03-04 11:15:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:15:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 11:15:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:37,377 INFO L225 Difference]: With dead ends: 294 [2025-03-04 11:15:37,377 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 11:15:37,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:15:37,378 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 254 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 92 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 11:15:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2025-03-04 11:15:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 238 states have (on average 1.5672268907563025) internal successors, (373), 276 states have internal predecessors, (373), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:15:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 389 transitions. [2025-03-04 11:15:37,388 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 389 transitions. Word has length 31 [2025-03-04 11:15:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:37,389 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 389 transitions. [2025-03-04 11:15:37,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 389 transitions. [2025-03-04 11:15:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:15:37,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:37,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:37,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:15:37,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 602748067, now seen corresponding path program 1 times [2025-03-04 11:15:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163296942] [2025-03-04 11:15:37,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:15:37,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:15:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163296942] [2025-03-04 11:15:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163296942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826170285] [2025-03-04 11:15:37,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:37,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:37,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:37,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:37,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:15:37,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:15:37,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:15:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:37,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:15:37,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:37,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826170285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:37,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:15:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 12 [2025-03-04 11:15:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413580412] [2025-03-04 11:15:37,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:15:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:37,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:15:37,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:15:37,579 INFO L87 Difference]: Start difference. First operand 286 states and 389 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:15:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:37,680 INFO L93 Difference]: Finished difference Result 773 states and 1048 transitions. [2025-03-04 11:15:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:15:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-04 11:15:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:37,683 INFO L225 Difference]: With dead ends: 773 [2025-03-04 11:15:37,683 INFO L226 Difference]: Without dead ends: 757 [2025-03-04 11:15:37,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:15:37,684 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 255 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:37,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 825 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:15:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-04 11:15:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 671. [2025-03-04 11:15:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 607 states have (on average 1.5897858319604612) internal successors, (965), 649 states have internal predecessors, (965), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 11:15:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1007 transitions. [2025-03-04 11:15:37,703 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1007 transitions. Word has length 32 [2025-03-04 11:15:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:37,703 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1007 transitions. [2025-03-04 11:15:37,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:15:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1007 transitions. [2025-03-04 11:15:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:15:37,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:37,704 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:15:37,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:15:37,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:37,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:37,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -579690399, now seen corresponding path program 1 times [2025-03-04 11:15:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725026594] [2025-03-04 11:15:37,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:37,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:15:37,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:15:37,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:37,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788613776] [2025-03-04 11:15:37,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:37,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:37,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:15:37,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:15:37,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:15:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:37,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:15:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:38,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725026594] [2025-03-04 11:15:39,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788613776] [2025-03-04 11:15:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788613776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:39,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:15:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2025-03-04 11:15:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454129983] [2025-03-04 11:15:39,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:39,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:15:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:39,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:15:39,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:15:39,023 INFO L87 Difference]: Start difference. First operand 671 states and 1007 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:40,875 INFO L93 Difference]: Finished difference Result 1197 states and 1824 transitions. [2025-03-04 11:15:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 11:15:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2025-03-04 11:15:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:40,879 INFO L225 Difference]: With dead ends: 1197 [2025-03-04 11:15:40,880 INFO L226 Difference]: Without dead ends: 1153 [2025-03-04 11:15:40,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=670, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:15:40,881 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 681 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:40,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 168 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 11:15:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-04 11:15:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 822. [2025-03-04 11:15:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 756 states have (on average 1.5145502645502646) internal successors, (1145), 796 states have internal predecessors, (1145), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 11:15:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1193 transitions. [2025-03-04 11:15:40,914 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1193 transitions. Word has length 34 [2025-03-04 11:15:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:40,915 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1193 transitions. [2025-03-04 11:15:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1193 transitions. [2025-03-04 11:15:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:15:40,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:40,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:40,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:41,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:41,120 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1736417225, now seen corresponding path program 1 times [2025-03-04 11:15:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609909931] [2025-03-04 11:15:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:41,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:15:41,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:15:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242865453] [2025-03-04 11:15:41,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:41,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:41,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:41,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:15:41,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:15:41,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:15:41,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:41,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:15:41,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:41,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609909931] [2025-03-04 11:15:41,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242865453] [2025-03-04 11:15:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242865453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:15:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378350632] [2025-03-04 11:15:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:41,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:15:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:41,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:15:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:41,286 INFO L87 Difference]: Start difference. First operand 822 states and 1193 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:41,665 INFO L93 Difference]: Finished difference Result 967 states and 1411 transitions. [2025-03-04 11:15:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:15:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 11:15:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:41,670 INFO L225 Difference]: With dead ends: 967 [2025-03-04 11:15:41,670 INFO L226 Difference]: Without dead ends: 960 [2025-03-04 11:15:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:15:41,671 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 239 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 104 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:15:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-04 11:15:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 823. [2025-03-04 11:15:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 758 states have (on average 1.4973614775725594) internal successors, (1135), 798 states have internal predecessors, (1135), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 11:15:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1181 transitions. [2025-03-04 11:15:41,705 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1181 transitions. Word has length 34 [2025-03-04 11:15:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1181 transitions. [2025-03-04 11:15:41,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1181 transitions. [2025-03-04 11:15:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:15:41,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:41,705 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:15:41,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:15:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:15:41,906 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -790533121, now seen corresponding path program 1 times [2025-03-04 11:15:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497749725] [2025-03-04 11:15:41,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:41,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:15:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:15:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:41,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619270549] [2025-03-04 11:15:41,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:41,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:41,924 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:41,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:15:41,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:15:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:15:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:41,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:15:41,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:42,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497749725] [2025-03-04 11:15:42,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619270549] [2025-03-04 11:15:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619270549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:42,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:15:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2025-03-04 11:15:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577159467] [2025-03-04 11:15:42,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:15:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:42,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:15:42,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:15:42,889 INFO L87 Difference]: Start difference. First operand 823 states and 1181 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:45,271 INFO L93 Difference]: Finished difference Result 1216 states and 1780 transitions. [2025-03-04 11:15:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:15:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 11:15:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:45,277 INFO L225 Difference]: With dead ends: 1216 [2025-03-04 11:15:45,277 INFO L226 Difference]: Without dead ends: 1176 [2025-03-04 11:15:45,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=587, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:15:45,279 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 515 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 184 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 11:15:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-04 11:15:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 888. [2025-03-04 11:15:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 824 states have (on average 1.4575242718446602) internal successors, (1201), 863 states have internal predecessors, (1201), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1245 transitions. [2025-03-04 11:15:45,320 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1245 transitions. Word has length 35 [2025-03-04 11:15:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1245 transitions. [2025-03-04 11:15:45,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1245 transitions. [2025-03-04 11:15:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:15:45,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:45,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:45,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:45,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:15:45,525 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2005640896, now seen corresponding path program 1 times [2025-03-04 11:15:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350086455] [2025-03-04 11:15:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:45,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:15:45,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:15:45,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:45,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483261818] [2025-03-04 11:15:45,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:45,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:45,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:45,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:15:45,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:15:45,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:15:45,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:45,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:15:45,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:45,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350086455] [2025-03-04 11:15:45,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483261818] [2025-03-04 11:15:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483261818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:45,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:45,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:15:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156949914] [2025-03-04 11:15:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:45,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:15:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:45,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:15:45,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:15:45,674 INFO L87 Difference]: Start difference. First operand 888 states and 1245 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:45,949 INFO L93 Difference]: Finished difference Result 903 states and 1257 transitions. [2025-03-04 11:15:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:15:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 11:15:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:45,951 INFO L225 Difference]: With dead ends: 903 [2025-03-04 11:15:45,951 INFO L226 Difference]: Without dead ends: 898 [2025-03-04 11:15:45,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:15:45,952 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 246 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:45,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 97 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-04 11:15:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 882. [2025-03-04 11:15:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 818 states have (on average 1.4327628361858191) internal successors, (1172), 857 states have internal predecessors, (1172), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1216 transitions. [2025-03-04 11:15:45,986 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1216 transitions. Word has length 35 [2025-03-04 11:15:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:45,986 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1216 transitions. [2025-03-04 11:15:45,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1216 transitions. [2025-03-04 11:15:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:15:45,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:45,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:45,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:46,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:15:46,187 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:46,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1263277087, now seen corresponding path program 1 times [2025-03-04 11:15:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:46,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140063853] [2025-03-04 11:15:46,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:46,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:15:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:15:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105458153] [2025-03-04 11:15:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:46,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:46,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:46,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:15:46,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:15:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:15:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:46,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:15:46,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:46,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140063853] [2025-03-04 11:15:47,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105458153] [2025-03-04 11:15:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105458153] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:47,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:15:47,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-04 11:15:47,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982314553] [2025-03-04 11:15:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:47,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:15:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:47,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:15:47,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:15:47,123 INFO L87 Difference]: Start difference. First operand 882 states and 1216 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:47,701 INFO L93 Difference]: Finished difference Result 901 states and 1236 transitions. [2025-03-04 11:15:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-04 11:15:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:47,707 INFO L225 Difference]: With dead ends: 901 [2025-03-04 11:15:47,707 INFO L226 Difference]: Without dead ends: 900 [2025-03-04 11:15:47,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:15:47,708 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:47,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 124 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:15:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-04 11:15:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 899. [2025-03-04 11:15:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 835 states have (on average 1.4191616766467066) internal successors, (1185), 874 states have internal predecessors, (1185), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1229 transitions. [2025-03-04 11:15:47,754 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1229 transitions. Word has length 36 [2025-03-04 11:15:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:47,754 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1229 transitions. [2025-03-04 11:15:47,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1229 transitions. [2025-03-04 11:15:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:15:47,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:47,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:47,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:15:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:15:47,955 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:47,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2045325653, now seen corresponding path program 1 times [2025-03-04 11:15:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081539238] [2025-03-04 11:15:47,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:47,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:15:47,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:15:47,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081539238] [2025-03-04 11:15:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081539238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829114819] [2025-03-04 11:15:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:47,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:47,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:47,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:47,992 INFO L87 Difference]: Start difference. First operand 899 states and 1229 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:48,132 INFO L93 Difference]: Finished difference Result 939 states and 1271 transitions. [2025-03-04 11:15:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-04 11:15:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:48,135 INFO L225 Difference]: With dead ends: 939 [2025-03-04 11:15:48,135 INFO L226 Difference]: Without dead ends: 938 [2025-03-04 11:15:48,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:48,135 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 36 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:48,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 182 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-04 11:15:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 921. [2025-03-04 11:15:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 857 states have (on average 1.4224037339556592) internal successors, (1219), 896 states have internal predecessors, (1219), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1263 transitions. [2025-03-04 11:15:48,177 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1263 transitions. Word has length 36 [2025-03-04 11:15:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1263 transitions. [2025-03-04 11:15:48,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1263 transitions. [2025-03-04 11:15:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:15:48,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:48,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:48,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:15:48,179 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:48,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash 506884093, now seen corresponding path program 1 times [2025-03-04 11:15:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827772558] [2025-03-04 11:15:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:48,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:15:48,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:15:48,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092754757] [2025-03-04 11:15:48,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:48,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:48,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:48,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:48,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:15:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:15:48,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:15:48,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:48,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:48,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:15:48,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:48,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827772558] [2025-03-04 11:15:49,359 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092754757] [2025-03-04 11:15:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092754757] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:15:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-04 11:15:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297328323] [2025-03-04 11:15:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:49,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:15:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:15:49,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:15:49,360 INFO L87 Difference]: Start difference. First operand 921 states and 1263 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:50,568 INFO L93 Difference]: Finished difference Result 925 states and 1267 transitions. [2025-03-04 11:15:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:15:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 11:15:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:50,571 INFO L225 Difference]: With dead ends: 925 [2025-03-04 11:15:50,571 INFO L226 Difference]: Without dead ends: 924 [2025-03-04 11:15:50,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:15:50,571 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:50,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 111 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 11:15:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-04 11:15:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 923. [2025-03-04 11:15:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 859 states have (on average 1.4155995343422585) internal successors, (1216), 898 states have internal predecessors, (1216), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1260 transitions. [2025-03-04 11:15:50,608 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1260 transitions. Word has length 37 [2025-03-04 11:15:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:50,609 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1260 transitions. [2025-03-04 11:15:50,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1260 transitions. [2025-03-04 11:15:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:15:50,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:50,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:50,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:15:50,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:50,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -887444599, now seen corresponding path program 1 times [2025-03-04 11:15:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500820702] [2025-03-04 11:15:50,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:15:50,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:15:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607795440] [2025-03-04 11:15:50,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:50,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:50,822 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:50,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:15:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:15:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:15:50,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:50,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:50,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:15:50,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:50,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500820702] [2025-03-04 11:15:50,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607795440] [2025-03-04 11:15:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607795440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:15:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943166916] [2025-03-04 11:15:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:15:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:15:50,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:15:50,980 INFO L87 Difference]: Start difference. First operand 923 states and 1260 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:51,231 INFO L93 Difference]: Finished difference Result 931 states and 1266 transitions. [2025-03-04 11:15:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:15:51,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 11:15:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:51,234 INFO L225 Difference]: With dead ends: 931 [2025-03-04 11:15:51,234 INFO L226 Difference]: Without dead ends: 930 [2025-03-04 11:15:51,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:15:51,235 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 159 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:51,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 197 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-04 11:15:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 923. [2025-03-04 11:15:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 859 states have (on average 1.4121071012805588) internal successors, (1213), 898 states have internal predecessors, (1213), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1257 transitions. [2025-03-04 11:15:51,277 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1257 transitions. Word has length 37 [2025-03-04 11:15:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:51,277 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1257 transitions. [2025-03-04 11:15:51,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1257 transitions. [2025-03-04 11:15:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:15:51,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:51,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:51,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:51,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:15:51,478 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1019414178, now seen corresponding path program 1 times [2025-03-04 11:15:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668718314] [2025-03-04 11:15:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:51,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:15:51,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:15:51,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:51,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668718314] [2025-03-04 11:15:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668718314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773071528] [2025-03-04 11:15:51,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:51,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:51,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:51,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:51,521 INFO L87 Difference]: Start difference. First operand 923 states and 1257 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:51,801 INFO L93 Difference]: Finished difference Result 940 states and 1261 transitions. [2025-03-04 11:15:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 11:15:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:51,803 INFO L225 Difference]: With dead ends: 940 [2025-03-04 11:15:51,803 INFO L226 Difference]: Without dead ends: 939 [2025-03-04 11:15:51,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:51,804 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:51,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-04 11:15:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 925. [2025-03-04 11:15:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 861 states have (on average 1.4088269454123112) internal successors, (1213), 900 states have internal predecessors, (1213), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1257 transitions. [2025-03-04 11:15:51,837 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1257 transitions. Word has length 37 [2025-03-04 11:15:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:51,837 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1257 transitions. [2025-03-04 11:15:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1257 transitions. [2025-03-04 11:15:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:15:51,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:51,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:51,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:15:51,838 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -913566431, now seen corresponding path program 1 times [2025-03-04 11:15:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843709731] [2025-03-04 11:15:51,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:51,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:15:51,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:15:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051234699] [2025-03-04 11:15:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:51,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:51,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:51,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:51,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:15:51,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:15:51,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:15:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:51,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:15:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:52,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843709731] [2025-03-04 11:15:53,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051234699] [2025-03-04 11:15:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051234699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:53,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:15:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 11:15:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123107930] [2025-03-04 11:15:53,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:15:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:53,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:15:53,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2025-03-04 11:15:53,905 INFO L87 Difference]: Start difference. First operand 925 states and 1257 transitions. Second operand has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:55,478 INFO L93 Difference]: Finished difference Result 1058 states and 1433 transitions. [2025-03-04 11:15:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:15:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-04 11:15:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:55,481 INFO L225 Difference]: With dead ends: 1058 [2025-03-04 11:15:55,481 INFO L226 Difference]: Without dead ends: 1057 [2025-03-04 11:15:55,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=200, Invalid=555, Unknown=1, NotChecked=0, Total=756 [2025-03-04 11:15:55,482 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 344 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:55,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 282 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 11:15:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-04 11:15:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 948. [2025-03-04 11:15:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 884 states have (on average 1.3993212669683257) internal successors, (1237), 923 states have internal predecessors, (1237), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1281 transitions. [2025-03-04 11:15:55,517 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1281 transitions. Word has length 38 [2025-03-04 11:15:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:55,518 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1281 transitions. [2025-03-04 11:15:55,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1281 transitions. [2025-03-04 11:15:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:15:55,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:55,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:55,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:15:55,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:15:55,719 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:55,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:55,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1864234183, now seen corresponding path program 1 times [2025-03-04 11:15:55,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:55,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653003253] [2025-03-04 11:15:55,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:55,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:15:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:15:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213102759] [2025-03-04 11:15:55,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:55,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:55,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:55,730 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:55,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:15:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:15:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:15:55,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:55,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:55,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:15:55,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:55,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653003253] [2025-03-04 11:15:55,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213102759] [2025-03-04 11:15:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213102759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:15:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451400344] [2025-03-04 11:15:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:15:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:55,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:15:55,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:15:55,985 INFO L87 Difference]: Start difference. First operand 948 states and 1281 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:56,207 INFO L93 Difference]: Finished difference Result 957 states and 1287 transitions. [2025-03-04 11:15:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:15:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-03-04 11:15:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:56,209 INFO L225 Difference]: With dead ends: 957 [2025-03-04 11:15:56,210 INFO L226 Difference]: Without dead ends: 955 [2025-03-04 11:15:56,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:15:56,211 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 164 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:56,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 207 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:15:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-04 11:15:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 948. [2025-03-04 11:15:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 884 states have (on average 1.3925339366515836) internal successors, (1231), 923 states have internal predecessors, (1231), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1275 transitions. [2025-03-04 11:15:56,244 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1275 transitions. Word has length 39 [2025-03-04 11:15:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:56,244 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1275 transitions. [2025-03-04 11:15:56,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1275 transitions. [2025-03-04 11:15:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:15:56,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:56,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:15:56,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:15:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:56,445 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1744211771, now seen corresponding path program 1 times [2025-03-04 11:15:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736606032] [2025-03-04 11:15:56,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:15:56,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:15:56,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:56,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:56,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530386559] [2025-03-04 11:15:56,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:56,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:56,457 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:56,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:15:56,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:15:56,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:15:56,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:56,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:56,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:15:56,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:15:56,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:15:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736606032] [2025-03-04 11:15:56,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530386559] [2025-03-04 11:15:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530386559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:15:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627462043] [2025-03-04 11:15:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:15:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:56,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:15:56,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:56,531 INFO L87 Difference]: Start difference. First operand 948 states and 1275 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:56,935 INFO L93 Difference]: Finished difference Result 970 states and 1287 transitions. [2025-03-04 11:15:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:15:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-03-04 11:15:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:56,937 INFO L225 Difference]: With dead ends: 970 [2025-03-04 11:15:56,937 INFO L226 Difference]: Without dead ends: 969 [2025-03-04 11:15:56,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:15:56,938 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 50 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:56,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 144 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:15:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-04 11:15:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 948. [2025-03-04 11:15:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 884 states have (on average 1.3868778280542986) internal successors, (1226), 923 states have internal predecessors, (1226), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 11:15:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1270 transitions. [2025-03-04 11:15:56,972 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1270 transitions. Word has length 39 [2025-03-04 11:15:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:56,973 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1270 transitions. [2025-03-04 11:15:56,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:15:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1270 transitions. [2025-03-04 11:15:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:15:56,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:56,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:15:56,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:15:57,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:57,174 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1956684881, now seen corresponding path program 1 times [2025-03-04 11:15:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784997363] [2025-03-04 11:15:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:15:57,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:15:57,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409206305] [2025-03-04 11:15:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:57,185 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:57,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:15:57,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:15:57,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:15:57,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:57,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:57,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:15:57,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:57,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784997363] [2025-03-04 11:15:58,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409206305] [2025-03-04 11:15:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409206305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:58,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:15:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-03-04 11:15:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733688704] [2025-03-04 11:15:58,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:58,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:15:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:58,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:15:58,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:15:58,025 INFO L87 Difference]: Start difference. First operand 948 states and 1270 transitions. Second operand has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:59,238 INFO L93 Difference]: Finished difference Result 1299 states and 1740 transitions. [2025-03-04 11:15:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:15:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-04 11:15:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:59,241 INFO L225 Difference]: With dead ends: 1299 [2025-03-04 11:15:59,241 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 11:15:59,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:15:59,242 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 476 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 143 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:15:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 11:15:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 880. [2025-03-04 11:15:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 818 states have (on average 1.3997555012224938) internal successors, (1145), 857 states have internal predecessors, (1145), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:15:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1185 transitions. [2025-03-04 11:15:59,283 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1185 transitions. Word has length 40 [2025-03-04 11:15:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:59,284 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1185 transitions. [2025-03-04 11:15:59,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:15:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1185 transitions. [2025-03-04 11:15:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:15:59,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:59,284 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:15:59,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:15:59,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:59,485 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:15:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1764009889, now seen corresponding path program 1 times [2025-03-04 11:15:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437561647] [2025-03-04 11:15:59,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:59,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:15:59,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:15:59,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:59,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:15:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986649598] [2025-03-04 11:15:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:15:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:59,495 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:59,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:15:59,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:15:59,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:15:59,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:15:59,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:59,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 11:15:59,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:59,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:15:59,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437561647] [2025-03-04 11:15:59,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:15:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986649598] [2025-03-04 11:15:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986649598] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:59,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:15:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-04 11:15:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870951605] [2025-03-04 11:15:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:15:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:59,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:15:59,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:15:59,994 INFO L87 Difference]: Start difference. First operand 880 states and 1185 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:16:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:00,507 INFO L93 Difference]: Finished difference Result 890 states and 1199 transitions. [2025-03-04 11:16:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:16:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-03-04 11:16:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:00,509 INFO L225 Difference]: With dead ends: 890 [2025-03-04 11:16:00,509 INFO L226 Difference]: Without dead ends: 889 [2025-03-04 11:16:00,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:16:00,510 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:00,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 124 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:16:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-04 11:16:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 888. [2025-03-04 11:16:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 826 states have (on average 1.3958837772397095) internal successors, (1153), 865 states have internal predecessors, (1153), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:16:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1193 transitions. [2025-03-04 11:16:00,546 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1193 transitions. Word has length 40 [2025-03-04 11:16:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1193 transitions. [2025-03-04 11:16:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:16:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1193 transitions. [2025-03-04 11:16:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:16:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:00,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:16:00,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 11:16:00,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 11:16:00,751 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:00,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1838335656, now seen corresponding path program 1 times [2025-03-04 11:16:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558402545] [2025-03-04 11:16:00,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:00,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:16:00,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:16:00,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:16:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119547152] [2025-03-04 11:16:00,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:00,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:16:00,763 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:16:00,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:16:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:16:00,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:16:00,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:00,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:00,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:16:00,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:16:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:16:00,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:16:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:16:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558402545] [2025-03-04 11:16:01,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:16:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119547152] [2025-03-04 11:16:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119547152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:16:01,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:16:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 11:16:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285040165] [2025-03-04 11:16:01,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:16:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:16:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:01,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:16:01,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:16:01,186 INFO L87 Difference]: Start difference. First operand 888 states and 1193 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:02,503 INFO L93 Difference]: Finished difference Result 951 states and 1274 transitions. [2025-03-04 11:16:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:16:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-04 11:16:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:02,505 INFO L225 Difference]: With dead ends: 951 [2025-03-04 11:16:02,505 INFO L226 Difference]: Without dead ends: 945 [2025-03-04 11:16:02,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:16:02,506 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 566 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:02,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 163 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:16:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-04 11:16:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 919. [2025-03-04 11:16:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 857 states have (on average 1.3908984830805133) internal successors, (1192), 895 states have internal predecessors, (1192), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:16:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1232 transitions. [2025-03-04 11:16:02,545 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1232 transitions. Word has length 42 [2025-03-04 11:16:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:02,545 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1232 transitions. [2025-03-04 11:16:02,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1232 transitions. [2025-03-04 11:16:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:16:02,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:02,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:16:02,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 11:16:02,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 11:16:02,746 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1409008806, now seen corresponding path program 1 times [2025-03-04 11:16:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48747251] [2025-03-04 11:16:02,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:02,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:16:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:16:02,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:02,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:16:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039483418] [2025-03-04 11:16:02,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:16:02,756 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:16:02,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 11:16:02,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:16:02,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:16:02,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:02,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:02,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:16:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:16:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:16:03,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:16:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:16:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48747251] [2025-03-04 11:16:03,307 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:16:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039483418] [2025-03-04 11:16:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039483418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:16:03,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:16:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 11:16:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485463962] [2025-03-04 11:16:03,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:16:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:16:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:16:03,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:16:03,308 INFO L87 Difference]: Start difference. First operand 919 states and 1232 transitions. Second operand has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:04,744 INFO L93 Difference]: Finished difference Result 944 states and 1259 transitions. [2025-03-04 11:16:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:16:04,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-04 11:16:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:04,747 INFO L225 Difference]: With dead ends: 944 [2025-03-04 11:16:04,747 INFO L226 Difference]: Without dead ends: 943 [2025-03-04 11:16:04,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:16:04,747 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 341 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:04,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 157 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 11:16:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-04 11:16:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 921. [2025-03-04 11:16:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 859 states have (on average 1.3864959254947613) internal successors, (1191), 897 states have internal predecessors, (1191), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:16:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1231 transitions. [2025-03-04 11:16:04,792 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1231 transitions. Word has length 44 [2025-03-04 11:16:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:04,792 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1231 transitions. [2025-03-04 11:16:04,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1231 transitions. [2025-03-04 11:16:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:16:04,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:04,792 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:16:04,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 11:16:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:04,993 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1142766244, now seen corresponding path program 1 times [2025-03-04 11:16:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6777003] [2025-03-04 11:16:04,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:04,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:16:05,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:16:05,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:05,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:16:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084257697] [2025-03-04 11:16:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:05,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:05,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:16:05,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:16:05,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 11:16:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:16:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:16:05,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:05,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:16:05,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:16:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:16:05,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:16:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6777003] [2025-03-04 11:16:05,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:16:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084257697] [2025-03-04 11:16:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084257697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:16:05,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:16:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 11:16:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602146284] [2025-03-04 11:16:05,809 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:16:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:16:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:05,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:16:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:16:05,809 INFO L87 Difference]: Start difference. First operand 921 states and 1231 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:16:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:07,083 INFO L93 Difference]: Finished difference Result 938 states and 1251 transitions. [2025-03-04 11:16:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:16:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-04 11:16:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:07,085 INFO L225 Difference]: With dead ends: 938 [2025-03-04 11:16:07,085 INFO L226 Difference]: Without dead ends: 937 [2025-03-04 11:16:07,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:16:07,086 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 180 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:07,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 225 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:16:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-04 11:16:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 912. [2025-03-04 11:16:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 850 states have (on average 1.3894117647058823) internal successors, (1181), 888 states have internal predecessors, (1181), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:16:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1221 transitions. [2025-03-04 11:16:07,130 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1221 transitions. Word has length 46 [2025-03-04 11:16:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1221 transitions. [2025-03-04 11:16:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:16:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1221 transitions. [2025-03-04 11:16:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:16:07,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:07,130 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:16:07,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 11:16:07,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:07,331 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1778206689, now seen corresponding path program 1 times [2025-03-04 11:16:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334760043] [2025-03-04 11:16:07,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:07,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:16:07,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:16:07,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:07,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:16:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334760043] [2025-03-04 11:16:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334760043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:16:07,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:16:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:16:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227728904] [2025-03-04 11:16:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:16:07,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:16:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:07,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:16:07,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:16:07,494 INFO L87 Difference]: Start difference. First operand 912 states and 1221 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:07,838 INFO L93 Difference]: Finished difference Result 1430 states and 1926 transitions. [2025-03-04 11:16:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:16:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-03-04 11:16:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:07,841 INFO L225 Difference]: With dead ends: 1430 [2025-03-04 11:16:07,841 INFO L226 Difference]: Without dead ends: 1100 [2025-03-04 11:16:07,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:16:07,842 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 257 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:07,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 243 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:16:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-03-04 11:16:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1063. [2025-03-04 11:16:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 996 states have (on average 1.4046184738955823) internal successors, (1399), 1034 states have internal predecessors, (1399), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 11:16:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1449 transitions. [2025-03-04 11:16:07,898 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1449 transitions. Word has length 52 [2025-03-04 11:16:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:07,898 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1449 transitions. [2025-03-04 11:16:07,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1449 transitions. [2025-03-04 11:16:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:16:07,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:07,898 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:16:07,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 11:16:07,898 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:07,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1780760001, now seen corresponding path program 1 times [2025-03-04 11:16:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:07,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136008149] [2025-03-04 11:16:07,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:07,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:16:07,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:16:07,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:07,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:16:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136008149] [2025-03-04 11:16:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136008149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:16:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:16:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:16:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842095388] [2025-03-04 11:16:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:16:07,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:16:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:07,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:16:07,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:16:07,939 INFO L87 Difference]: Start difference. First operand 1063 states and 1449 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:16:08,081 INFO L93 Difference]: Finished difference Result 1063 states and 1449 transitions. [2025-03-04 11:16:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:16:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-03-04 11:16:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:16:08,084 INFO L225 Difference]: With dead ends: 1063 [2025-03-04 11:16:08,084 INFO L226 Difference]: Without dead ends: 1060 [2025-03-04 11:16:08,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:16:08,084 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:16:08,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 103 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:16:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-04 11:16:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2025-03-04 11:16:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 996 states have (on average 1.390562248995984) internal successors, (1385), 1031 states have internal predecessors, (1385), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 11:16:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1435 transitions. [2025-03-04 11:16:08,140 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1435 transitions. Word has length 52 [2025-03-04 11:16:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:16:08,140 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1435 transitions. [2025-03-04 11:16:08,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1435 transitions. [2025-03-04 11:16:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 11:16:08,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:16:08,141 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:16:08,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 11:16:08,141 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 11:16:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:16:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -633084285, now seen corresponding path program 1 times [2025-03-04 11:16:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:16:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554129097] [2025-03-04 11:16:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:16:08,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:16:08,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:16:08,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:08,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:16:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1439765124] [2025-03-04 11:16:08,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:16:08,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:16:08,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:16:08,153 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:16:08,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 11:16:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:16:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:16:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:16:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:16:08,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:16:08,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:16:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:16:32,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:16:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:16:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554129097] [2025-03-04 11:16:33,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:16:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439765124] [2025-03-04 11:16:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439765124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:16:33,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:16:33,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 11:16:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231087056] [2025-03-04 11:16:33,973 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:16:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:16:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:16:33,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:16:33,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=377, Unknown=6, NotChecked=0, Total=462 [2025-03-04 11:16:33,974 INFO L87 Difference]: Start difference. First operand 1060 states and 1435 transitions. Second operand has 15 states, 13 states have (on average 3.769230769230769) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:16:37,999 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 [0] [2025-03-04 11:16:42,004 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 [0] [2025-03-04 11:16:44,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 11:16:50,040 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 [0] [2025-03-04 11:16:52,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 11:17:07,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]