./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_15_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 968635f18a28870168009bfe8d7e422c316a8658b55cd7107db985a9eb51370f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 16:36:44,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 16:36:44,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 16:36:44,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 16:36:44,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 16:36:44,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 16:36:44,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 16:36:44,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 16:36:44,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 16:36:44,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 16:36:44,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 16:36:44,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 16:36:44,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 16:36:44,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 16:36:44,181 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 16:36:44,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 16:36:44,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 16:36:44,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:36:44,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 16:36:44,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 16:36:44,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 16:36:44,184 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 968635f18a28870168009bfe8d7e422c316a8658b55cd7107db985a9eb51370f [2025-02-06 16:36:44,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 16:36:44,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 16:36:44,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 16:36:44,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 16:36:44,374 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 16:36:44,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_15_good.i [2025-02-06 16:36:45,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e49429c/98890f39c3a1447d80d8a91c65f928c2/FLAG4e4b70638 [2025-02-06 16:36:45,888 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 16:36:45,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_15_good.i [2025-02-06 16:36:45,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e49429c/98890f39c3a1447d80d8a91c65f928c2/FLAG4e4b70638 [2025-02-06 16:36:45,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33e49429c/98890f39c3a1447d80d8a91c65f928c2 [2025-02-06 16:36:45,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 16:36:45,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 16:36:45,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 16:36:45,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 16:36:45,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 16:36:45,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:45" (1/1) ... [2025-02-06 16:36:45,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e348ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:45, skipping insertion in model container [2025-02-06 16:36:45,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:36:45" (1/1) ... [2025-02-06 16:36:45,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 16:36:46,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:36:46,441 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 16:36:46,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 16:36:46,640 INFO L204 MainTranslator]: Completed translation [2025-02-06 16:36:46,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46 WrapperNode [2025-02-06 16:36:46,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 16:36:46,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 16:36:46,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 16:36:46,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 16:36:46,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,682 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 165 [2025-02-06 16:36:46,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 16:36:46,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 16:36:46,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 16:36:46,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 16:36:46,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,699 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 16:36:46,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 16:36:46,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 16:36:46,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 16:36:46,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 16:36:46,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (1/1) ... [2025-02-06 16:36:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 16:36:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 16:36:46,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 16:36:46,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 16:36:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 16:36:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 16:36:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 16:36:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 16:36:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 16:36:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 16:36:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 16:36:46,887 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 16:36:46,888 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 16:36:47,030 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-02-06 16:36:47,031 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 16:36:47,037 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 16:36:47,037 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 16:36:47,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:47 BoogieIcfgContainer [2025-02-06 16:36:47,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 16:36:47,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 16:36:47,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 16:36:47,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 16:36:47,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:36:45" (1/3) ... [2025-02-06 16:36:47,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:47, skipping insertion in model container [2025-02-06 16:36:47,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:36:46" (2/3) ... [2025-02-06 16:36:47,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:36:47, skipping insertion in model container [2025-02-06 16:36:47,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:47" (3/3) ... [2025-02-06 16:36:47,043 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_postinc_15_good.i [2025-02-06 16:36:47,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 16:36:47,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_postinc_15_good.i that has 3 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 16:36:47,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 16:36:47,112 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;@44b7fbe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 16:36:47,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 16:36:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 16:36:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 16:36:47,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1361044562, now seen corresponding path program 1 times [2025-02-06 16:36:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659126863] [2025-02-06 16:36:47,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 16:36:47,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 16:36:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:36:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659126863] [2025-02-06 16:36:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659126863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747074947] [2025-02-06 16:36:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,295 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-06 16:36:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,323 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2025-02-06 16:36:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-02-06 16:36:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,328 INFO L225 Difference]: With dead ends: 156 [2025-02-06 16:36:47,328 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 16:36:47,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,335 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 16:36:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-02-06 16:36:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 66 states have internal predecessors, (76), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 16:36:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2025-02-06 16:36:47,381 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 14 [2025-02-06 16:36:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,381 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2025-02-06 16:36:47,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-06 16:36:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2025-02-06 16:36:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 16:36:47,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 16:36:47,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1133367503, now seen corresponding path program 1 times [2025-02-06 16:36:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243503055] [2025-02-06 16:36:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 16:36:47,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 16:36:47,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:36:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243503055] [2025-02-06 16:36:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243503055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273381092] [2025-02-06 16:36:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,470 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 16:36:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,491 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2025-02-06 16:36:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-02-06 16:36:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,492 INFO L225 Difference]: With dead ends: 125 [2025-02-06 16:36:47,492 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 16:36:47,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,493 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 16:36:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 16:36:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 16:36:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2025-02-06 16:36:47,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 15 [2025-02-06 16:36:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,503 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2025-02-06 16:36:47,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-06 16:36:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2025-02-06 16:36:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 16:36:47,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 16:36:47,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,505 INFO L85 PathProgramCache]: Analyzing trace with hash -547561371, now seen corresponding path program 1 times [2025-02-06 16:36:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262271092] [2025-02-06 16:36:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 16:36:47,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 16:36:47,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 16:36:47,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262271092] [2025-02-06 16:36:47,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262271092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210747579] [2025-02-06 16:36:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,585 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-06 16:36:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,606 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2025-02-06 16:36:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2025-02-06 16:36:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,610 INFO L225 Difference]: With dead ends: 111 [2025-02-06 16:36:47,610 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 16:36:47,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,611 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 16:36:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 16:36:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 54 states have internal predecessors, (60), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 16:36:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2025-02-06 16:36:47,620 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 19 [2025-02-06 16:36:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,621 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2025-02-06 16:36:47,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-02-06 16:36:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2025-02-06 16:36:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 16:36:47,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 16:36:47,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash 417756795, now seen corresponding path program 1 times [2025-02-06 16:36:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753919894] [2025-02-06 16:36:47,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 16:36:47,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 16:36:47,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753919894] [2025-02-06 16:36:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753919894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83016530] [2025-02-06 16:36:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,671 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 16:36:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,682 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2025-02-06 16:36:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2025-02-06 16:36:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,683 INFO L225 Difference]: With dead ends: 111 [2025-02-06 16:36:47,683 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 16:36:47,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,684 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 16:36:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-06 16:36:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 53 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 16:36:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-02-06 16:36:47,688 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 23 [2025-02-06 16:36:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,688 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-02-06 16:36:47,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 16:36:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-02-06 16:36:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 16:36:47,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 16:36:47,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1924292576, now seen corresponding path program 1 times [2025-02-06 16:36:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622026344] [2025-02-06 16:36:47,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 16:36:47,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 16:36:47,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:47,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622026344] [2025-02-06 16:36:47,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622026344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966240059] [2025-02-06 16:36:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,725 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,748 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2025-02-06 16:36:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-06 16:36:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,749 INFO L225 Difference]: With dead ends: 106 [2025-02-06 16:36:47,749 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 16:36:47,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,750 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 153 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 16:36:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-02-06 16:36:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 56 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 16:36:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-02-06 16:36:47,754 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 25 [2025-02-06 16:36:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,754 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-02-06 16:36:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-02-06 16:36:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 16:36:47,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 16:36:47,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -415427537, now seen corresponding path program 1 times [2025-02-06 16:36:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740951525] [2025-02-06 16:36:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 16:36:47,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 16:36:47,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740951525] [2025-02-06 16:36:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740951525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224535295] [2025-02-06 16:36:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,784 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,792 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2025-02-06 16:36:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-06 16:36:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,793 INFO L225 Difference]: With dead ends: 99 [2025-02-06 16:36:47,793 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 16:36:47,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,794 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 16:36:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 16:36:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 16:36:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2025-02-06 16:36:47,798 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 26 [2025-02-06 16:36:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2025-02-06 16:36:47,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2025-02-06 16:36:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 16:36:47,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 16:36:47,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1476532667, now seen corresponding path program 1 times [2025-02-06 16:36:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187518806] [2025-02-06 16:36:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 16:36:47,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 16:36:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 16:36:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187518806] [2025-02-06 16:36:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187518806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488294006] [2025-02-06 16:36:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,830 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,838 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-02-06 16:36:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-06 16:36:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,839 INFO L225 Difference]: With dead ends: 85 [2025-02-06 16:36:47,839 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 16:36:47,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,840 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 16:36:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 16:36:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 43 states have internal predecessors, (47), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 16:36:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-02-06 16:36:47,843 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 31 [2025-02-06 16:36:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,843 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-02-06 16:36:47,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 16:36:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-02-06 16:36:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 16:36:47,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 16:36:47,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1543696106, now seen corresponding path program 1 times [2025-02-06 16:36:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228413553] [2025-02-06 16:36:47,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 16:36:47,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 16:36:47,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228413553] [2025-02-06 16:36:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228413553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267792248] [2025-02-06 16:36:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:36:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:36:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:36:47,922 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,938 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-02-06 16:36:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:36:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-02-06 16:36:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,939 INFO L225 Difference]: With dead ends: 60 [2025-02-06 16:36:47,939 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 16:36:47,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:36:47,939 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 16:36:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-06 16:36:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 47 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 16:36:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-02-06 16:36:47,943 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 36 [2025-02-06 16:36:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,944 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-02-06 16:36:47,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-02-06 16:36:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 16:36:47,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:47,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 16:36:47,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1543725897, now seen corresponding path program 1 times [2025-02-06 16:36:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110109584] [2025-02-06 16:36:47,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 16:36:47,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 16:36:47,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110109584] [2025-02-06 16:36:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110109584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640704541] [2025-02-06 16:36:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:47,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:47,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:47,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,973 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:47,983 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-02-06 16:36:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-02-06 16:36:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:47,983 INFO L225 Difference]: With dead ends: 82 [2025-02-06 16:36:47,984 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 16:36:47,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:47,984 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:47,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 16:36:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 16:36:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 46 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 16:36:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-02-06 16:36:47,988 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 36 [2025-02-06 16:36:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:47,988 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-02-06 16:36:47,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-02-06 16:36:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 16:36:47,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:47,989 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-02-06 16:36:47,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 16:36:47,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1204839671, now seen corresponding path program 1 times [2025-02-06 16:36:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707716776] [2025-02-06 16:36:47,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:47,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 16:36:48,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 16:36:48,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:48,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 16:36:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707716776] [2025-02-06 16:36:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707716776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212983981] [2025-02-06 16:36:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:48,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:48,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:48,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,018 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 16:36:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:48,025 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2025-02-06 16:36:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-02-06 16:36:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:48,026 INFO L225 Difference]: With dead ends: 76 [2025-02-06 16:36:48,026 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 16:36:48,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,027 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:48,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 16:36:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 16:36:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 16:36:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-02-06 16:36:48,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 40 [2025-02-06 16:36:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:48,030 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-02-06 16:36:48,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 16:36:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-02-06 16:36:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 16:36:48,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:48,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:48,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 16:36:48,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1521489481, now seen corresponding path program 1 times [2025-02-06 16:36:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402634134] [2025-02-06 16:36:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:48,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 16:36:48,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 16:36:48,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:48,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402634134] [2025-02-06 16:36:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402634134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550150940] [2025-02-06 16:36:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:48,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:48,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:48,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,076 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:48,090 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-02-06 16:36:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-06 16:36:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:48,091 INFO L225 Difference]: With dead ends: 62 [2025-02-06 16:36:48,091 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 16:36:48,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,092 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:48,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 16:36:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 16:36:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 16:36:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-06 16:36:48,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2025-02-06 16:36:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-06 16:36:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 16:36:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-06 16:36:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 16:36:48,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:48,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:48,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 16:36:48,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -532366498, now seen corresponding path program 1 times [2025-02-06 16:36:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612891453] [2025-02-06 16:36:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:48,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 16:36:48,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 16:36:48,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:48,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612891453] [2025-02-06 16:36:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612891453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:48,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:48,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:48,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396684470] [2025-02-06 16:36:48,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:48,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 16:36:48,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:48,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 16:36:48,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:36:48,194 INFO L87 Difference]: Start difference. First operand 45 states and 50 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 16:36:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:48,206 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-02-06 16:36:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 16:36:48,206 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-02-06 16:36:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:48,207 INFO L225 Difference]: With dead ends: 51 [2025-02-06 16:36:48,207 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 16:36:48,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 16:36:48,207 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 16:36:48,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 16:36:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 16:36:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 38 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 16:36:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-02-06 16:36:48,210 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 48 [2025-02-06 16:36:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:48,210 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-02-06 16:36:48,210 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 16:36:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-02-06 16:36:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 16:36:48,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 16:36:48,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 16:36:48,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 16:36:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 16:36:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 678476890, now seen corresponding path program 1 times [2025-02-06 16:36:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 16:36:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017517718] [2025-02-06 16:36:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 16:36:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 16:36:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 16:36:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 16:36:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 16:36:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 16:36:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 16:36:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 16:36:48,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017517718] [2025-02-06 16:36:48,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017517718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 16:36:48,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 16:36:48,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 16:36:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899421421] [2025-02-06 16:36:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 16:36:48,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 16:36:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 16:36:48,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 16:36:48,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,236 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 16:36:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 16:36:48,238 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-06 16:36:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 16:36:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-02-06 16:36:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 16:36:48,238 INFO L225 Difference]: With dead ends: 49 [2025-02-06 16:36:48,238 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 16:36:48,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 16:36:48,239 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 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-02-06 16:36:48,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 16:36:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 16:36:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 16:36:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 16:36:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 16:36:48,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2025-02-06 16:36:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 16:36:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 16:36:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 16:36:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 16:36:48,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 16:36:48,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 16:36:48,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 16:36:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 16:36:48,245 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 16:36:48,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 16:36:48,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 16:36:48,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:36:48 BoogieIcfgContainer [2025-02-06 16:36:48,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 16:36:48,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 16:36:48,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 16:36:48,272 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 16:36:48,273 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:36:47" (3/4) ... [2025-02-06 16:36:48,274 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 16:36:48,278 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 16:36:48,279 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 16:36:48,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 16:36:48,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 16:36:48,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 16:36:48,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 16:36:48,283 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 16:36:48,370 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 16:36:48,370 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 16:36:48,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 16:36:48,370 INFO L158 Benchmark]: Toolchain (without parser) took 2456.59ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 74.8MB in the end (delta: 54.8MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-02-06 16:36:48,371 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:48,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.05ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 68.5MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 16:36:48,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.48ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:48,371 INFO L158 Benchmark]: Boogie Preprocessor took 21.54ms. Allocated memory is still 167.8MB. Free memory was 65.6MB in the beginning and 63.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:48,371 INFO L158 Benchmark]: IcfgBuilder took 330.73ms. Allocated memory is still 167.8MB. Free memory was 63.9MB in the beginning and 47.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 16:36:48,372 INFO L158 Benchmark]: TraceAbstraction took 1233.24ms. Allocated memory is still 167.8MB. Free memory was 47.3MB in the beginning and 82.1MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 16:36:48,372 INFO L158 Benchmark]: Witness Printer took 97.73ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 74.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 16:36:48,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.05ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 68.5MB in the end (delta: 61.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.48ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.54ms. Allocated memory is still 167.8MB. Free memory was 65.6MB in the beginning and 63.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 330.73ms. Allocated memory is still 167.8MB. Free memory was 63.9MB in the beginning and 47.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1233.24ms. Allocated memory is still 167.8MB. Free memory was 47.3MB in the beginning and 82.1MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 97.73ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 74.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 1781 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 915 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 866 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 100/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 16:36:48,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE