./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:44:55,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:44:55,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:44:55,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:44:55,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:44:55,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:44:55,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:44:55,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:44:55,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:44:55,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:44:55,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:44:55,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:44:55,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:44:55,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:44:55,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:44:55,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:44:55,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:44:55,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:44:55,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:44:55,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:44:55,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:44:55,898 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b [2025-03-04 12:44:56,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:44:56,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:44:56,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:44:56,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:44:56,133 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:44:56,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2025-03-04 12:44:57,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973428fa2/0fa700844dc949b89f42b65452a90ba6/FLAGde381a3a0 [2025-03-04 12:44:57,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:44:57,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2025-03-04 12:44:57,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973428fa2/0fa700844dc949b89f42b65452a90ba6/FLAGde381a3a0 [2025-03-04 12:44:57,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/973428fa2/0fa700844dc949b89f42b65452a90ba6 [2025-03-04 12:44:57,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:44:57,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:44:57,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:44:57,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:44:57,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:44:57,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:57,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:57, skipping insertion in model container [2025-03-04 12:44:57,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:44:57" (1/1) ... [2025-03-04 12:44:57,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:44:58,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:44:58,352 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:44:58,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:44:58,528 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:44:58,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58 WrapperNode [2025-03-04 12:44:58,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:44:58,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:44:58,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:44:58,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:44:58,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,580 INFO L138 Inliner]: procedures = 499, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2025-03-04 12:44:58,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:44:58,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:44:58,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:44:58,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:44:58,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,604 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 12:44:58,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:44:58,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:44:58,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:44:58,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:44:58,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (1/1) ... [2025-03-04 12:44:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:44:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:44:58,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 12:44:58,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 12:44:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:44:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:44:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2025-03-04 12:44:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2025-03-04 12:44:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:44:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:44:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:44:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:44:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:44:58,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:44:58,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:44:58,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2025-03-04 12:44:58,939 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-04 12:44:58,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:44:58,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:44:58,950 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:44:58,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58 BoogieIcfgContainer [2025-03-04 12:44:58,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:44:58,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:44:58,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:44:58,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:44:58,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:44:57" (1/3) ... [2025-03-04 12:44:58,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cb99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:58, skipping insertion in model container [2025-03-04 12:44:58,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:44:58" (2/3) ... [2025-03-04 12:44:58,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cb99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:44:58, skipping insertion in model container [2025-03-04 12:44:58,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58" (3/3) ... [2025-03-04 12:44:58,959 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2025-03-04 12:44:58,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:44:58,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i that has 4 procedures, 62 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 12:44:59,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:44:59,018 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;@5097991a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:44:59,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 12:44:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 12:44:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:44:59,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash -215421108, now seen corresponding path program 1 times [2025-03-04 12:44:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654896570] [2025-03-04 12:44:59,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:44:59,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:44:59,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:44:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654896570] [2025-03-04 12:44:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654896570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942350925] [2025-03-04 12:44:59,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,320 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,362 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2025-03-04 12:44:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 12:44:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,369 INFO L225 Difference]: With dead ends: 62 [2025-03-04 12:44:59,369 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 12:44:59,371 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-03-04 12:44:59,373 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 12:44:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 12:44:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 12:44:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-04 12:44:59,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 22 [2025-03-04 12:44:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,407 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-04 12:44:59,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-04 12:44:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 12:44:59,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:44:59,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash -215431038, now seen corresponding path program 1 times [2025-03-04 12:44:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391509055] [2025-03-04 12:44:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 12:44:59,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 12:44:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:44:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391509055] [2025-03-04 12:44:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391509055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59580204] [2025-03-04 12:44:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,531 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,556 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2025-03-04 12:44:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 12:44:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,560 INFO L225 Difference]: With dead ends: 50 [2025-03-04 12:44:59,560 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 12:44:59,560 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-03-04 12:44:59,561 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 12:44:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 12:44:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 12:44:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-03-04 12:44:59,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 22 [2025-03-04 12:44:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,573 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-03-04 12:44:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 12:44:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-03-04 12:44:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:44:59,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 12:44:59,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1911880262, now seen corresponding path program 1 times [2025-03-04 12:44:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851960103] [2025-03-04 12:44:59,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:44:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:44:59,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:44:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851960103] [2025-03-04 12:44:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851960103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:44:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490670497] [2025-03-04 12:44:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:44:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:44:59,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,629 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,646 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-03-04 12:44:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:44:59,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-03-04 12:44:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,648 INFO L225 Difference]: With dead ends: 49 [2025-03-04 12:44:59,648 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 12:44:59,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,649 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 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-03-04 12:44:59,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 12:44:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 12:44:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 12:44:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-03-04 12:44:59,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23 [2025-03-04 12:44:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,656 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-03-04 12:44:59,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-03-04 12:44:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 12:44:59,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:44:59,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1911572422, now seen corresponding path program 1 times [2025-03-04 12:44:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836282671] [2025-03-04 12:44:59,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 12:44:59,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 12:44:59,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 12:44:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836282671] [2025-03-04 12:44:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836282671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:44:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053654096] [2025-03-04 12:44:59,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:44:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:44:59,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,736 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,749 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-03-04 12:44:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:44:59,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-03-04 12:44:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,750 INFO L225 Difference]: With dead ends: 48 [2025-03-04 12:44:59,750 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 12:44:59,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:44:59,751 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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-03-04 12:44:59,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 12:44:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 12:44:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 12:44:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-03-04 12:44:59,760 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 23 [2025-03-04 12:44:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,761 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-03-04 12:44:59,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:44:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-03-04 12:44:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 12:44:59,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,762 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:44:59,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:44:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -362972909, now seen corresponding path program 1 times [2025-03-04 12:44:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021734106] [2025-03-04 12:44:59,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 12:44:59,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 12:44:59,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 12:44:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021734106] [2025-03-04 12:44:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021734106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731449084] [2025-03-04 12:44:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,863 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,885 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2025-03-04 12:44:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,886 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-04 12:44:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,886 INFO L225 Difference]: With dead ends: 47 [2025-03-04 12:44:59,886 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 12:44:59,887 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-03-04 12:44:59,887 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 12:44:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 12:44:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 12:44:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-04 12:44:59,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 40 [2025-03-04 12:44:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,896 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-04 12:44:59,896 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-04 12:44:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 12:44:59,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:44:59,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:44:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 12:44:59,898 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-03-04 12:44:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:44:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -362972685, now seen corresponding path program 1 times [2025-03-04 12:44:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:44:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258109630] [2025-03-04 12:44:59,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:44:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:44:59,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 12:44:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 12:44:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:44:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:44:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 12:44:59,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:44:59,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258109630] [2025-03-04 12:44:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258109630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:44:59,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:44:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:44:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023841018] [2025-03-04 12:44:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:44:59,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:44:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:44:59,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:44:59,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:44:59,980 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:44:59,991 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2025-03-04 12:44:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:44:59,991 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-04 12:44:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:44:59,992 INFO L225 Difference]: With dead ends: 43 [2025-03-04 12:44:59,992 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:44:59,993 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-03-04 12:44:59,993 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:44:59,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:44:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:44:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:44:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 12:44:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:44:59,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-04 12:44:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:44:59,997 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:44:59,997 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), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 12:44:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:44:59,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:44:59,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 12:44:59,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 12:45:00,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 12:45:00,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 12:45:00,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 12:45:00,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 12:45:00,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 12:45:00,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 12:45:00,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 12:45:00,004 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 12:45:00,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:45:00,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:45:00,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:45:00 BoogieIcfgContainer [2025-03-04 12:45:00,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:45:00,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:45:00,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:45:00,036 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:45:00,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:44:58" (3/4) ... [2025-03-04 12:45:00,038 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:45:00,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:45:00,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrueOrFalse [2025-03-04 12:45:00,045 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:45:00,047 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 12:45:00,047 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 12:45:00,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 12:45:00,048 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:45:00,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:45:00,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:45:00,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:45:00,110 INFO L158 Benchmark]: Toolchain (without parser) took 2264.77ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 61.5MB in the end (delta: 48.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-04 12:45:00,111 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:00,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.16ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 49.0MB in the end (delta: 60.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 12:45:00,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.47ms. Allocated memory is still 142.6MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:00,111 INFO L158 Benchmark]: Boogie Preprocessor took 37.68ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 44.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:00,111 INFO L158 Benchmark]: IcfgBuilder took 330.89ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 97.9MB in the end (delta: -53.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-04 12:45:00,112 INFO L158 Benchmark]: TraceAbstraction took 1084.25ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 68.1MB in the end (delta: 29.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-03-04 12:45:00,112 INFO L158 Benchmark]: Witness Printer took 73.55ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 61.5MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:45:00,113 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 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.16ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 49.0MB in the end (delta: 60.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.47ms. Allocated memory is still 142.6MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.68ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 44.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 330.89ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 97.9MB in the end (delta: -53.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1084.25ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 68.1MB in the end (delta: 29.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 73.55ms. Allocated memory is still 142.6MB. Free memory was 68.1MB in the beginning and 61.5MB in the end (delta: 6.5MB). There was no memory consumed. 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: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: 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 4 procedures, 62 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 867 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 338 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 56/56 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-03-04 12:45:00,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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