./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_07_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_07_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5993340823159cedbac4f5ba5fcaa90a21012b9996ef462928f4e22ba5288e70 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:06:28,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:06:28,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:06:28,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:06:28,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:06:28,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:06:28,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:06:28,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:06:28,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:06:28,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:06:28,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:06:28,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:06:28,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:06:28,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:06:28,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:06:28,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:06:28,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:06:28,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:06:28,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:06:28,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:06:28,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:06:28,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:06:28,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:06:28,288 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:06:28,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:06:28,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:06:28,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:06:28,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:06:28,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:06:28,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:06:28,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:06:28,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:06:28,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:06:28,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:06:28,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:06:28,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:06:28,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:06:28,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:06:28,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:06:28,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:06:28,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:06:28,295 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 5993340823159cedbac4f5ba5fcaa90a21012b9996ef462928f4e22ba5288e70 [2024-10-11 23:06:28,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:06:28,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:06:28,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:06:28,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:06:28,531 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:06:28,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_07_good.i [2024-10-11 23:06:29,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:06:30,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:06:30,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_07_good.i [2024-10-11 23:06:30,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc00f5ce6/3cbb12103c8b440a9069914f3d0b1f43/FLAGef2a14922 [2024-10-11 23:06:30,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc00f5ce6/3cbb12103c8b440a9069914f3d0b1f43 [2024-10-11 23:06:30,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:06:30,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:06:30,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:06:30,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:06:30,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:06:30,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:30" (1/1) ... [2024-10-11 23:06:30,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f8520d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:30, skipping insertion in model container [2024-10-11 23:06:30,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:30" (1/1) ... [2024-10-11 23:06:30,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:06:30,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:06:30,936 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:06:30,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:06:31,064 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:06:31,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31 WrapperNode [2024-10-11 23:06:31,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:06:31,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:06:31,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:06:31,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:06:31,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,108 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 110 [2024-10-11 23:06:31,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:06:31,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:06:31,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:06:31,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:06:31,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,127 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:06:31,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:06:31,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:06:31,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:06:31,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:06:31,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (1/1) ... [2024-10-11 23:06:31,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:06:31,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:06:31,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:06:31,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:06:31,250 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:06:31,250 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:06:31,250 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:06:31,250 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:06:31,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:06:31,381 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:06:31,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:06:31,589 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 23:06:31,589 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:06:31,613 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:06:31,613 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:06:31,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:31 BoogieIcfgContainer [2024-10-11 23:06:31,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:06:31,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:06:31,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:06:31,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:06:31,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:06:30" (1/3) ... [2024-10-11 23:06:31,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164cfd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:31, skipping insertion in model container [2024-10-11 23:06:31,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:31" (2/3) ... [2024-10-11 23:06:31,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164cfd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:31, skipping insertion in model container [2024-10-11 23:06:31,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:31" (3/3) ... [2024-10-11 23:06:31,621 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_postdec_07_good.i [2024-10-11 23:06:31,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:06:31,635 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:06:31,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:06:31,686 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;@42dcf12d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:06:31,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:06:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 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) [2024-10-11 23:06:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 23:06:31,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:31,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:31,698 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)] === [2024-10-11 23:06:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1905490627, now seen corresponding path program 1 times [2024-10-11 23:06:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537212188] [2024-10-11 23:06:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:06:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537212188] [2024-10-11 23:06:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537212188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:31,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:06:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838456822] [2024-10-11 23:06:31,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:31,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:06:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:06:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:31,965 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 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) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 23:06:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,009 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-10-11 23:06:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:06:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-10-11 23:06:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,018 INFO L225 Difference]: With dead ends: 58 [2024-10-11 23:06:32,018 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 23:06:32,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:32,023 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 23:06:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 23:06:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 40 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:06:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-10-11 23:06:32,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 11 [2024-10-11 23:06:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,087 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-11 23:06:32,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 23:06:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-10-11 23:06:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 23:06:32,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:06:32,088 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)] === [2024-10-11 23:06:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1059332771, now seen corresponding path program 1 times [2024-10-11 23:06:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772017326] [2024-10-11 23:06:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:06:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772017326] [2024-10-11 23:06:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772017326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297067683] [2024-10-11 23:06:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,216 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-11 23:06:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,246 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-11 23:06:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-10-11 23:06:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,248 INFO L225 Difference]: With dead ends: 52 [2024-10-11 23:06:32,248 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 23:06:32,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,250 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 23:06:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-11 23:06:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 39 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 23:06:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-10-11 23:06:32,262 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 12 [2024-10-11 23:06:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,263 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-10-11 23:06:32,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-11 23:06:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-10-11 23:06:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 23:06:32,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:06:32,265 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)] === [2024-10-11 23:06:32,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -450922645, now seen corresponding path program 1 times [2024-10-11 23:06:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918439329] [2024-10-11 23:06:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 23:06:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:06:32,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918439329] [2024-10-11 23:06:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918439329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379823460] [2024-10-11 23:06:32,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:06:32,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:06:32,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:32,313 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-11 23:06:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,333 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2024-10-11 23:06:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:06:32,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 20 [2024-10-11 23:06:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,335 INFO L225 Difference]: With dead ends: 92 [2024-10-11 23:06:32,335 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 23:06:32,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:32,336 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 42 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 23:06:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 23:06:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-11 23:06:32,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2024-10-11 23:06:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,341 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-11 23:06:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-11 23:06:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-11 23:06:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 23:06:32,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:06:32,342 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)] === [2024-10-11 23:06:32,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -56135982, now seen corresponding path program 1 times [2024-10-11 23:06:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234530043] [2024-10-11 23:06:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:06:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234530043] [2024-10-11 23:06:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234530043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:06:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839586328] [2024-10-11 23:06:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:06:32,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:06:32,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:32,387 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-10-11 23:06:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,402 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-11 23:06:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:06:32,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2024-10-11 23:06:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,405 INFO L225 Difference]: With dead ends: 46 [2024-10-11 23:06:32,405 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 23:06:32,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:32,406 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 23:06:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 23:06:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-11 23:06:32,416 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 21 [2024-10-11 23:06:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,417 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-11 23:06:32,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-10-11 23:06:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-10-11 23:06:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 23:06:32,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:06:32,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1740215354, now seen corresponding path program 1 times [2024-10-11 23:06:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417330606] [2024-10-11 23:06:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:06:32,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417330606] [2024-10-11 23:06:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417330606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673178367] [2024-10-11 23:06:32,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,498 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-11 23:06:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,517 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-11 23:06:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 22 [2024-10-11 23:06:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,519 INFO L225 Difference]: With dead ends: 45 [2024-10-11 23:06:32,519 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 23:06:32,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,520 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 23:06:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 23:06:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-11 23:06:32,525 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2024-10-11 23:06:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,526 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-11 23:06:32,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-11 23:06:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-11 23:06:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 23:06:32,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,527 INFO L215 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] [2024-10-11 23:06:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:06:32,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1334380327, now seen corresponding path program 1 times [2024-10-11 23:06:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134050016] [2024-10-11 23:06:32,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 23:06:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:06:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134050016] [2024-10-11 23:06:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134050016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80054399] [2024-10-11 23:06:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,581 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-11 23:06:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,599 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-11 23:06:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 30 [2024-10-11 23:06:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,600 INFO L225 Difference]: With dead ends: 44 [2024-10-11 23:06:32,600 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 23:06:32,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,601 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 23:06:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 23:06:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-11 23:06:32,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2024-10-11 23:06:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,606 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-11 23:06:32,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-11 23:06:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-11 23:06:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 23:06:32,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,607 INFO L215 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] [2024-10-11 23:06:32,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:06:32,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1583882937, now seen corresponding path program 1 times [2024-10-11 23:06:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622358226] [2024-10-11 23:06:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 23:06:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 23:06:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622358226] [2024-10-11 23:06:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622358226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873273219] [2024-10-11 23:06:32,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,665 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-10-11 23:06:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,682 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-11 23:06:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 31 [2024-10-11 23:06:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,683 INFO L225 Difference]: With dead ends: 43 [2024-10-11 23:06:32,683 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 23:06:32,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,684 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 23:06:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 23:06:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-11 23:06:32,690 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 31 [2024-10-11 23:06:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-11 23:06:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-10-11 23:06:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-11 23:06:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 23:06:32,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:06:32,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:32,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1535877418, now seen corresponding path program 1 times [2024-10-11 23:06:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798038994] [2024-10-11 23:06:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 23:06:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:06:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:06:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798038994] [2024-10-11 23:06:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798038994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590520859] [2024-10-11 23:06:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,757 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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) [2024-10-11 23:06:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,772 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-11 23:06:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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 39 [2024-10-11 23:06:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,773 INFO L225 Difference]: With dead ends: 42 [2024-10-11 23:06:32,773 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 23:06:32,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,774 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 23:06:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 23:06:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:06:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-11 23:06:32,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 39 [2024-10-11 23:06:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-11 23:06:32,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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) [2024-10-11 23:06:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-11 23:06:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 23:06:32,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:32,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:06:32,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -367559569, now seen corresponding path program 1 times [2024-10-11 23:06:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969214078] [2024-10-11 23:06:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 23:06:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 23:06:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:06:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:06:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969214078] [2024-10-11 23:06:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969214078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:32,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:32,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087774508] [2024-10-11 23:06:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,841 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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) [2024-10-11 23:06:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:32,857 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-10-11 23:06:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:32,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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 40 [2024-10-11 23:06:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:32,858 INFO L225 Difference]: With dead ends: 41 [2024-10-11 23:06:32,858 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:06:32,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:32,861 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:32,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:06:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:06:32,862 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) [2024-10-11 23:06:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:06:32,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-10-11 23:06:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:06:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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) [2024-10-11 23:06:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:06:32,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:06:32,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:06:32,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:06:32,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:06:32,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:06:32,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:06:32,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:06:32,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:06:32,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:06:32,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:06:32,871 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:32,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:06:32,906 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:06:32,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:06:32 BoogieIcfgContainer [2024-10-11 23:06:32,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:06:32,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:06:32,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:06:32,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:06:32,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:31" (3/4) ... [2024-10-11 23:06:32,936 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:06:32,939 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:06:32,939 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:06:32,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 23:06:32,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 23:06:32,946 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:06:32,947 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:06:33,023 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:06:33,023 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:06:33,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:06:33,024 INFO L158 Benchmark]: Toolchain (without parser) took 2848.11ms. Allocated memory was 180.4MB in the beginning and 285.2MB in the end (delta: 104.9MB). Free memory was 121.1MB in the beginning and 164.5MB in the end (delta: -43.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,024 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:06:33,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 887.50ms. Allocated memory is still 180.4MB. Free memory was 121.1MB in the beginning and 96.6MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.65ms. Allocated memory is still 180.4MB. Free memory was 96.6MB in the beginning and 93.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,025 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 180.4MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,025 INFO L158 Benchmark]: RCFGBuilder took 466.11ms. Allocated memory is still 180.4MB. Free memory was 91.7MB in the beginning and 140.2MB in the end (delta: -48.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,025 INFO L158 Benchmark]: TraceAbstraction took 1318.91ms. Allocated memory was 180.4MB in the beginning and 285.2MB in the end (delta: 104.9MB). Free memory was 140.2MB in the beginning and 170.8MB in the end (delta: -30.7MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,025 INFO L158 Benchmark]: Witness Printer took 89.86ms. Allocated memory is still 285.2MB. Free memory was 170.8MB in the beginning and 164.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:06:33,028 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.09ms. Allocated memory is still 94.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 887.50ms. Allocated memory is still 180.4MB. Free memory was 121.1MB in the beginning and 96.6MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.65ms. Allocated memory is still 180.4MB. Free memory was 96.6MB in the beginning and 93.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 180.4MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.11ms. Allocated memory is still 180.4MB. Free memory was 91.7MB in the beginning and 140.2MB in the end (delta: -48.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.91ms. Allocated memory was 180.4MB in the beginning and 285.2MB in the end (delta: 104.9MB). Free memory was 140.2MB in the beginning and 170.8MB in the end (delta: -30.7MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 89.86ms. Allocated memory is still 285.2MB. Free memory was 170.8MB in the beginning and 164.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1612]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 1052 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 622 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 430 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 9 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 32/32 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 23:06:33,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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