./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/CWE191_Integer_Underflow__int_fscanf_postdec_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 a1dbf7e2eb7d89429a091ba20920f5c1d14c563cd21f76567c8e99a8b1f781b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 05:29:23,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 05:29:23,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 05:29:23,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 05:29:23,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 05:29:23,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 05:29:23,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 05:29:23,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 05:29:23,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 05:29:23,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 05:29:23,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 05:29:23,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 05:29:23,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 05:29:23,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 05:29:23,124 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 05:29:23,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 05:29:23,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 05:29:23,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 05:29:23,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 05:29:23,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 05:29:23,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:29:23,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:29:23,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:29:23,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:29:23,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 05:29:23,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 05:29:23,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:29:23,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 05:29:23,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 05:29:23,128 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 -> a1dbf7e2eb7d89429a091ba20920f5c1d14c563cd21f76567c8e99a8b1f781b5 [2025-01-10 05:29:23,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 05:29:23,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 05:29:23,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 05:29:23,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 05:29:23,419 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 05:29:23,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2025-01-10 05:29:24,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b5f8529f/bd09444a0fac4451a062878ccc4da7bc/FLAGe523abe29 [2025-01-10 05:29:25,105 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 05:29:25,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2025-01-10 05:29:25,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b5f8529f/bd09444a0fac4451a062878ccc4da7bc/FLAGe523abe29 [2025-01-10 05:29:25,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b5f8529f/bd09444a0fac4451a062878ccc4da7bc [2025-01-10 05:29:25,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 05:29:25,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 05:29:25,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 05:29:25,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 05:29:25,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 05:29:25,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:29:25" (1/1) ... [2025-01-10 05:29:25,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b72b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:25, skipping insertion in model container [2025-01-10 05:29:25,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:29:25" (1/1) ... [2025-01-10 05:29:25,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 05:29:25,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:29:25,940 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 05:29:26,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 05:29:26,265 INFO L204 MainTranslator]: Completed translation [2025-01-10 05:29:26,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26 WrapperNode [2025-01-10 05:29:26,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 05:29:26,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 05:29:26,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 05:29:26,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 05:29:26,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,317 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 177 [2025-01-10 05:29:26,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 05:29:26,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 05:29:26,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 05:29:26,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 05:29:26,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,335 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 05:29:26,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 05:29:26,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 05:29:26,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 05:29:26,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 05:29:26,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (1/1) ... [2025-01-10 05:29:26,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 05:29:26,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 05:29:26,380 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-01-10 05:29:26,384 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-01-10 05:29:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 05:29:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 05:29:26,413 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 05:29:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 05:29:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 05:29:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 05:29:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 05:29:26,561 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 05:29:26,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 05:29:26,805 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-01-10 05:29:26,806 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 05:29:26,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 05:29:26,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 05:29:26,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:26 BoogieIcfgContainer [2025-01-10 05:29:26,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 05:29:26,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 05:29:26,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 05:29:26,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 05:29:26,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:29:25" (1/3) ... [2025-01-10 05:29:26,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55895704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:29:26, skipping insertion in model container [2025-01-10 05:29:26,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:29:26" (2/3) ... [2025-01-10 05:29:26,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55895704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:29:26, skipping insertion in model container [2025-01-10 05:29:26,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:26" (3/3) ... [2025-01-10 05:29:26,835 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2025-01-10 05:29:26,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 05:29:26,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i that has 3 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 05:29:26,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 05:29:26,965 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;@6ff03626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 05:29:26,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 05:29:26,969 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-01-10 05:29:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 05:29:26,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:26,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:26,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:26,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1492055446, now seen corresponding path program 1 times [2025-01-10 05:29:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:26,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667059100] [2025-01-10 05:29:26,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 05:29:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 05:29:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667059100] [2025-01-10 05:29:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667059100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:29:27,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255825232] [2025-01-10 05:29:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:27,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,289 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, 2 states have (on average 6.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-01-10 05:29:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,330 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2025-01-10 05:29:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.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-01-10 05:29:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,343 INFO L225 Difference]: With dead ends: 81 [2025-01-10 05:29:27,343 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 05:29:27,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,350 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 215 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-01-10 05:29:27,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 05:29:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 05:29:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5) internal successors, (69), 61 states have internal predecessors, (69), 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-01-10 05:29:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2025-01-10 05:29:27,386 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 14 [2025-01-10 05:29:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,386 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2025-01-10 05:29:27,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.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-01-10 05:29:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2025-01-10 05:29:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 05:29:27,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 05:29:27,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 990921503, now seen corresponding path program 1 times [2025-01-10 05:29:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184538029] [2025-01-10 05:29:27,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 05:29:27,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 05:29:27,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184538029] [2025-01-10 05:29:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184538029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678953653] [2025-01-10 05:29:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:27,513 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-01-10 05:29:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,546 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2025-01-10 05:29:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:27,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 05:29:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,548 INFO L225 Difference]: With dead ends: 70 [2025-01-10 05:29:27,548 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 05:29:27,548 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-01-10 05:29:27,549 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:27,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 255 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 05:29:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-01-10 05:29:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 60 states have internal predecessors, (68), 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-01-10 05:29:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2025-01-10 05:29:27,562 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 15 [2025-01-10 05:29:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2025-01-10 05:29:27,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 05:29:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2025-01-10 05:29:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 05:29:27,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,564 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-01-10 05:29:27,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 05:29:27,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -124139516, now seen corresponding path program 1 times [2025-01-10 05:29:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518623088] [2025-01-10 05:29:27,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 05:29:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 05:29:27,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 05:29:27,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518623088] [2025-01-10 05:29:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518623088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757014516] [2025-01-10 05:29:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:27,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:27,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,619 INFO L87 Difference]: Start difference. First operand 67 states and 94 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-01-10 05:29:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,639 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2025-01-10 05:29:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:27,640 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-01-10 05:29:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,641 INFO L225 Difference]: With dead ends: 117 [2025-01-10 05:29:27,641 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 05:29:27,641 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-01-10 05:29:27,642 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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-01-10 05:29:27,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 05:29:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 05:29:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 60 states have internal predecessors, (67), 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-01-10 05:29:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-01-10 05:29:27,654 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 19 [2025-01-10 05:29:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,654 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-01-10 05:29:27,654 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-01-10 05:29:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-01-10 05:29:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 05:29:27,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,655 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-01-10 05:29:27,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 05:29:27,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1651573367, now seen corresponding path program 1 times [2025-01-10 05:29:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686272128] [2025-01-10 05:29:27,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 05:29:27,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 05:29:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:29:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686272128] [2025-01-10 05:29:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686272128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008043086] [2025-01-10 05:29:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:27,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,688 INFO L87 Difference]: Start difference. First operand 67 states and 93 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-01-10 05:29:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,710 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2025-01-10 05:29:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:27,711 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-01-10 05:29:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,712 INFO L225 Difference]: With dead ends: 117 [2025-01-10 05:29:27,712 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 05:29:27,712 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-01-10 05:29:27,713 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 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-01-10 05:29:27,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 05:29:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 05:29:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 05:29:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2025-01-10 05:29:27,723 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 23 [2025-01-10 05:29:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,723 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2025-01-10 05:29:27,724 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-01-10 05:29:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2025-01-10 05:29:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 05:29:27,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,724 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-01-10 05:29:27,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 05:29:27,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1868040253, now seen corresponding path program 1 times [2025-01-10 05:29:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832894371] [2025-01-10 05:29:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 05:29:27,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 05:29:27,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:29:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832894371] [2025-01-10 05:29:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832894371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 05:29:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595144648] [2025-01-10 05:29:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,805 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 3 states, 2 states have (on average 9.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-01-10 05:29:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,817 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2025-01-10 05:29:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.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-01-10 05:29:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,819 INFO L225 Difference]: With dead ends: 66 [2025-01-10 05:29:27,819 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 05:29:27,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:27,819 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 169 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-01-10 05:29:27,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 169 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 05:29:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 05:29:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 58 states have internal predecessors, (65), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 05:29:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-01-10 05:29:27,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 25 [2025-01-10 05:29:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,824 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-01-10 05:29:27,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.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-01-10 05:29:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-01-10 05:29:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 05:29:27,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,825 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-01-10 05:29:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 05:29:27,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2074673103, now seen corresponding path program 1 times [2025-01-10 05:29:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497969421] [2025-01-10 05:29:27,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 05:29:27,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 05:29:27,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:29:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497969421] [2025-01-10 05:29:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497969421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:27,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90567366] [2025-01-10 05:29:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:27,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:27,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:27,891 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-01-10 05:29:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:27,911 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2025-01-10 05:29:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-01-10 05:29:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:27,914 INFO L225 Difference]: With dead ends: 67 [2025-01-10 05:29:27,914 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 05:29:27,914 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-01-10 05:29:27,915 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:27,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 05:29:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-01-10 05:29:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.391304347826087) internal successors, (64), 57 states have internal predecessors, (64), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 05:29:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2025-01-10 05:29:27,927 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 26 [2025-01-10 05:29:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:27,927 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2025-01-10 05:29:27,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-01-10 05:29:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2025-01-10 05:29:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 05:29:27,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:27,929 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-01-10 05:29:27,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 05:29:27,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash -291753928, now seen corresponding path program 1 times [2025-01-10 05:29:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513832277] [2025-01-10 05:29:27,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:27,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 05:29:27,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 05:29:27,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:27,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 05:29:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513832277] [2025-01-10 05:29:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513832277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241194643] [2025-01-10 05:29:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:28,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:28,008 INFO L87 Difference]: Start difference. First operand 64 states and 88 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-01-10 05:29:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,024 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2025-01-10 05:29:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:28,026 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-01-10 05:29:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,027 INFO L225 Difference]: With dead ends: 97 [2025-01-10 05:29:28,027 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 05:29:28,028 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-01-10 05:29:28,028 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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-01-10 05:29:28,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 05:29:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 05:29:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) 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), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 05:29:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-01-10 05:29:28,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 31 [2025-01-10 05:29:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-01-10 05:29:28,040 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-01-10 05:29:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2025-01-10 05:29:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 05:29:28,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,041 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-01-10 05:29:28,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 05:29:28,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash 413607982, now seen corresponding path program 1 times [2025-01-10 05:29:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730491146] [2025-01-10 05:29:28,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 05:29:28,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 05:29:28,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730491146] [2025-01-10 05:29:28,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730491146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491574063] [2025-01-10 05:29:28,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:28,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:28,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:28,126 INFO L87 Difference]: Start difference. First operand 62 states and 83 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-01-10 05:29:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,153 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2025-01-10 05:29:28,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:28,154 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-01-10 05:29:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,156 INFO L225 Difference]: With dead ends: 64 [2025-01-10 05:29:28,156 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 05:29:28,157 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-01-10 05:29:28,157 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:28,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 220 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 05:29:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-01-10 05:29:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) 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), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 05:29:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2025-01-10 05:29:28,170 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 36 [2025-01-10 05:29:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,170 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2025-01-10 05:29:28,170 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-01-10 05:29:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2025-01-10 05:29:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 05:29:28,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,171 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] [2025-01-10 05:29:28,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 05:29:28,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash -63054300, now seen corresponding path program 1 times [2025-01-10 05:29:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986286571] [2025-01-10 05:29:28,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 05:29:28,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 05:29:28,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986286571] [2025-01-10 05:29:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986286571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317140420] [2025-01-10 05:29:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:28,240 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 05:29:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,270 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2025-01-10 05:29:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 37 [2025-01-10 05:29:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,272 INFO L225 Difference]: With dead ends: 70 [2025-01-10 05:29:28,272 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 05:29:28,272 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-01-10 05:29:28,274 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:28,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 05:29:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-01-10 05:29:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 05:29:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2025-01-10 05:29:28,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 37 [2025-01-10 05:29:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,284 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2025-01-10 05:29:28,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 05:29:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2025-01-10 05:29:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 05:29:28,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,287 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] [2025-01-10 05:29:28,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 05:29:28,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash -61207258, now seen corresponding path program 1 times [2025-01-10 05:29:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007795044] [2025-01-10 05:29:28,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 05:29:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 05:29:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007795044] [2025-01-10 05:29:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007795044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055967189] [2025-01-10 05:29:28,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:28,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:28,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:28,327 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-10 05:29:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,343 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2025-01-10 05:29:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2025-01-10 05:29:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,344 INFO L225 Difference]: With dead ends: 92 [2025-01-10 05:29:28,344 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 05:29:28,345 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-01-10 05:29:28,345 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 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-01-10 05:29:28,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 05:29:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 05:29:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 57 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-10 05:29:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-01-10 05:29:28,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 37 [2025-01-10 05:29:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-01-10 05:29:28,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-10 05:29:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-01-10 05:29:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 05:29:28,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,355 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, 1] [2025-01-10 05:29:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 05:29:28,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1160049289, now seen corresponding path program 1 times [2025-01-10 05:29:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375243720] [2025-01-10 05:29:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 05:29:28,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 05:29:28,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 05:29:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375243720] [2025-01-10 05:29:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375243720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304506885] [2025-01-10 05:29:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:28,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:28,403 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-10 05:29:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,416 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2025-01-10 05:29:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:28,417 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), 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 41 [2025-01-10 05:29:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,418 INFO L225 Difference]: With dead ends: 87 [2025-01-10 05:29:28,418 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 05:29:28,418 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-01-10 05:29:28,419 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 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-01-10 05:29:28,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 05:29:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 05:29:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 05:29:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2025-01-10 05:29:28,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 41 [2025-01-10 05:29:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2025-01-10 05:29:28,433 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), 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-01-10 05:29:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2025-01-10 05:29:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 05:29:28,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,434 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-01-10 05:29:28,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 05:29:28,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 177542752, now seen corresponding path program 1 times [2025-01-10 05:29:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129955268] [2025-01-10 05:29:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 05:29:28,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 05:29:28,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129955268] [2025-01-10 05:29:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129955268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871100376] [2025-01-10 05:29:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:28,482 INFO L87 Difference]: Start difference. First operand 59 states and 77 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-01-10 05:29:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,491 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-01-10 05:29:28,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:28,492 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-01-10 05:29:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,493 INFO L225 Difference]: With dead ends: 74 [2025-01-10 05:29:28,493 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 05:29:28,493 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-01-10 05:29:28,494 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 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-01-10 05:29:28,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 05:29:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 05:29:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 05:29:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2025-01-10 05:29:28,505 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 42 [2025-01-10 05:29:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,505 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2025-01-10 05:29:28,505 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-01-10 05:29:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2025-01-10 05:29:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 05:29:28,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,506 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-01-10 05:29:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 05:29:28,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 782683390, now seen corresponding path program 1 times [2025-01-10 05:29:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915249444] [2025-01-10 05:29:28,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 05:29:28,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 05:29:28,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915249444] [2025-01-10 05:29:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915249444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093356330] [2025-01-10 05:29:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:28,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:28,576 INFO L87 Difference]: Start difference. First operand 57 states and 72 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-01-10 05:29:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,588 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-01-10 05:29:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:28,589 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-01-10 05:29:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,590 INFO L225 Difference]: With dead ends: 57 [2025-01-10 05:29:28,590 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 05:29:28,590 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-01-10 05:29:28,591 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:28,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 196 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 05:29:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 05:29:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 49 states have internal predecessors, (53), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 05:29:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-01-10 05:29:28,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 48 [2025-01-10 05:29:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,597 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-01-10 05:29:28,597 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-01-10 05:29:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-01-10 05:29:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 05:29:28,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,598 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-01-10 05:29:28,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 05:29:28,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1506618506, now seen corresponding path program 1 times [2025-01-10 05:29:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108885463] [2025-01-10 05:29:28,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 05:29:28,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 05:29:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108885463] [2025-01-10 05:29:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108885463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792553232] [2025-01-10 05:29:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 05:29:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 05:29:28,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 05:29:28,696 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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-01-10 05:29:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,716 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-01-10 05:29:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 05:29:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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-01-10 05:29:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,718 INFO L225 Difference]: With dead ends: 61 [2025-01-10 05:29:28,718 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 05:29:28,719 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-01-10 05:29:28,719 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 05:29:28,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 05:29:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 05:29:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 49 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 05:29:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-01-10 05:29:28,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 49 [2025-01-10 05:29:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,725 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-01-10 05:29:28,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (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-01-10 05:29:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-01-10 05:29:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 05:29:28,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 05:29:28,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:28,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 05:29:28,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 05:29:28,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 05:29:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 594786653, now seen corresponding path program 1 times [2025-01-10 05:29:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 05:29:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382567828] [2025-01-10 05:29:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 05:29:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 05:29:28,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 05:29:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 05:29:28,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 05:29:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 05:29:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 05:29:28,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 05:29:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382567828] [2025-01-10 05:29:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382567828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 05:29:28,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 05:29:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 05:29:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465475167] [2025-01-10 05:29:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 05:29:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 05:29:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 05:29:28,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 05:29:28,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 05:29:28,778 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 05:29:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 05:29:28,785 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-01-10 05:29:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 05:29:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 50 [2025-01-10 05:29:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 05:29:28,786 INFO L225 Difference]: With dead ends: 60 [2025-01-10 05:29:28,786 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 05:29:28,787 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-01-10 05:29:28,789 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 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-01-10 05:29:28,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 05:29:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 05:29:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 05:29:28,790 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-01-10 05:29:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 05:29:28,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-01-10 05:29:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 05:29:28,791 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 05:29:28,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-10 05:29:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 05:29:28,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 05:29:28,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 05:29:28,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 05:29:28,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 05:29:28,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 05:29:28,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 05:29:28,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 05:29:28,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 05:29:28,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 05:29:28,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 05:29:28,799 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 05:29:28,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 05:29:28,831 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 05:29:28,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:29:28 BoogieIcfgContainer [2025-01-10 05:29:28,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 05:29:28,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 05:29:28,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 05:29:28,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 05:29:28,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:29:26" (3/4) ... [2025-01-10 05:29:28,843 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 05:29:28,848 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 05:29:28,848 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 05:29:28,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 05:29:28,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 05:29:28,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 05:29:28,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:29:28,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 05:29:28,940 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 05:29:28,941 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 05:29:28,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 05:29:28,942 INFO L158 Benchmark]: Toolchain (without parser) took 3662.09ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 111.6MB in the end (delta: 8.8MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-01-10 05:29:28,942 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:28,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 984.76ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 59.3MB in the end (delta: 61.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-10 05:29:28,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.80ms. Allocated memory is still 167.8MB. Free memory was 59.3MB in the beginning and 56.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:29:28,943 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 167.8MB. Free memory was 56.2MB in the beginning and 54.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:28,943 INFO L158 Benchmark]: RCFGBuilder took 475.93ms. Allocated memory is still 167.8MB. Free memory was 54.3MB in the beginning and 37.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 05:29:28,943 INFO L158 Benchmark]: TraceAbstraction took 2012.36ms. Allocated memory is still 167.8MB. Free memory was 37.0MB in the beginning and 118.6MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 05:29:28,944 INFO L158 Benchmark]: Witness Printer took 101.89ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 111.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 05:29:28,945 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 984.76ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 59.3MB in the end (delta: 61.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.80ms. Allocated memory is still 167.8MB. Free memory was 59.3MB in the beginning and 56.2MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 167.8MB. Free memory was 56.2MB in the beginning and 54.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 475.93ms. Allocated memory is still 167.8MB. Free memory was 54.3MB in the beginning and 37.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2012.36ms. Allocated memory is still 167.8MB. Free memory was 37.0MB in the beginning and 118.6MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 101.89ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 111.6MB in the end (delta: 7.0MB). 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: 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 - 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2801 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1586 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1215 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 51, 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, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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-01-10 05:29:28,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE