./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_rand_multiply_21_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_21_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 581522e9e3c23d87aea856650063b12bdf4651f6ba25ce5b77ba740d096d10fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:15:51,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:15:51,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 23:15:51,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:15:51,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:15:51,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:15:51,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:15:51,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:15:51,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:15:51,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:15:51,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:15:51,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:15:51,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:15:51,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:15:51,592 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:15:51,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:15:51,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:15:51,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 23:15:51,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:15:51,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:15:51,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:15:51,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:15:51,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:15:51,595 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:15:51,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:15:51,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:15:51,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:15:51,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:15:51,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:15:51,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:15:51,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:15:51,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:15:51,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:15:51,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:15:51,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:15:51,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 23:15:51,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 23:15:51,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:15:51,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:15:51,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:15:51,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:15:51,600 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/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/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 -> 581522e9e3c23d87aea856650063b12bdf4651f6ba25ce5b77ba740d096d10fb [2024-10-14 23:15:51,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:15:51,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:15:51,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:15:51,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:15:51,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:15:51,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_21_good.i [2024-10-14 23:15:53,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:15:53,635 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:15:53,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_multiply_21_good.i [2024-10-14 23:15:53,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e493927dd/7a3b1b9fe9054a3ebd3f5304df1f7087/FLAG7a8eb09d5 [2024-10-14 23:15:53,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e493927dd/7a3b1b9fe9054a3ebd3f5304df1f7087 [2024-10-14 23:15:53,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:15:53,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:15:53,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:15:53,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:15:53,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:15:53,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:53" (1/1) ... [2024-10-14 23:15:53,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309eb0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:53, skipping insertion in model container [2024-10-14 23:15:53,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:53" (1/1) ... [2024-10-14 23:15:53,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:15:54,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:15:54,522 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:15:54,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:15:54,722 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:15:54,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54 WrapperNode [2024-10-14 23:15:54,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:15:54,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:15:54,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:15:54,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:15:54,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,783 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 202 [2024-10-14 23:15:54,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:15:54,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:15:54,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:15:54,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:15:54,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,812 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 23:15:54,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:15:54,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:15:54,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:15:54,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:15:54,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (1/1) ... [2024-10-14 23:15:54,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:15:54,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:15:54,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 23:15:54,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 23:15:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 23:15:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 23:15:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 23:15:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 23:15:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:15:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:15:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:15:55,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:15:55,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:15:55,480 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-14 23:15:55,484 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:15:55,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:15:55,532 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 23:15:55,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:55 BoogieIcfgContainer [2024-10-14 23:15:55,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:15:55,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:15:55,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:15:55,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:15:55,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:53" (1/3) ... [2024-10-14 23:15:55,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6458e2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:55, skipping insertion in model container [2024-10-14 23:15:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:54" (2/3) ... [2024-10-14 23:15:55,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6458e2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:55, skipping insertion in model container [2024-10-14 23:15:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:55" (3/3) ... [2024-10-14 23:15:55,541 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_multiply_21_good.i [2024-10-14 23:15:55,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:15:55,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 23:15:55,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:15:55,643 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;@30726301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:15:55,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 23:15:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 74 states have (on average 1.554054054054054) internal successors, (115), 80 states have internal predecessors, (115), 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-14 23:15:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 23:15:55,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:55,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:55,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 462501268, now seen corresponding path program 1 times [2024-10-14 23:15:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637424595] [2024-10-14 23:15:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:55,988 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-14 23:15:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637424595] [2024-10-14 23:15:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637424595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741325012] [2024-10-14 23:15:55,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,031 INFO L87 Difference]: Start difference. First operand has 91 states, 74 states have (on average 1.554054054054054) internal successors, (115), 80 states have internal predecessors, (115), 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) Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-14 23:15:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,085 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2024-10-14 23:15:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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 17 [2024-10-14 23:15:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,093 INFO L225 Difference]: With dead ends: 91 [2024-10-14 23:15:56,093 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 23:15:56,096 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-14 23:15:56,099 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:15:56,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 23:15:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 23:15:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 75 states have internal predecessors, (108), 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-14 23:15:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-10-14 23:15:56,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 17 [2024-10-14 23:15:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,135 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-10-14 23:15:56,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-14 23:15:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-10-14 23:15:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 23:15:56,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 23:15:56,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1452637560, now seen corresponding path program 1 times [2024-10-14 23:15:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193566721] [2024-10-14 23:15:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,235 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-14 23:15:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193566721] [2024-10-14 23:15:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193566721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342092352] [2024-10-14 23:15:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,238 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:15:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,269 INFO L93 Difference]: Finished difference Result 84 states and 120 transitions. [2024-10-14 23:15:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-10-14 23:15:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,273 INFO L225 Difference]: With dead ends: 84 [2024-10-14 23:15:56,273 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 23:15:56,274 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-14 23:15:56,275 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:15:56,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 23:15:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 23:15:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 74 states have internal predecessors, (107), 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-14 23:15:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-10-14 23:15:56,289 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 18 [2024-10-14 23:15:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-10-14 23:15:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 23:15:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-10-14 23:15:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 23:15:56,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 23:15:56,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1217068830, now seen corresponding path program 1 times [2024-10-14 23:15:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608299445] [2024-10-14 23:15:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,416 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-14 23:15:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608299445] [2024-10-14 23:15:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608299445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140263207] [2024-10-14 23:15:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,423 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-14 23:15:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,460 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-10-14 23:15:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 26 [2024-10-14 23:15:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,462 INFO L225 Difference]: With dead ends: 83 [2024-10-14 23:15:56,462 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 23:15:56,463 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-14 23:15:56,464 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 217 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-14 23:15:56,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 23:15:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 23:15:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 73 states have internal predecessors, (106), 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-14 23:15:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-10-14 23:15:56,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 26 [2024-10-14 23:15:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-10-14 23:15:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-14 23:15:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-10-14 23:15:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 23:15:56,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 23:15:56,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash -903056613, now seen corresponding path program 1 times [2024-10-14 23:15:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500391] [2024-10-14 23:15:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,585 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-14 23:15:56,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500391] [2024-10-14 23:15:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 23:15:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589312124] [2024-10-14 23:15:56,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,589 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-14 23:15:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,615 INFO L93 Difference]: Finished difference Result 95 states and 129 transitions. [2024-10-14 23:15:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 27 [2024-10-14 23:15:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,618 INFO L225 Difference]: With dead ends: 95 [2024-10-14 23:15:56,618 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 23:15:56,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:15:56,619 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:15:56,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 23:15:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 23:15:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 77 states have internal predecessors, (110), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:15:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-10-14 23:15:56,630 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 27 [2024-10-14 23:15:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,630 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-10-14 23:15:56,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-14 23:15:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-10-14 23:15:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 23:15:56,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 23:15:56,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -925571689, now seen corresponding path program 1 times [2024-10-14 23:15:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505320467] [2024-10-14 23:15:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,708 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-14 23:15:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505320467] [2024-10-14 23:15:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505320467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116054056] [2024-10-14 23:15:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,711 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-14 23:15:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,736 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2024-10-14 23:15:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2024-10-14 23:15:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,740 INFO L225 Difference]: With dead ends: 88 [2024-10-14 23:15:56,740 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 23:15:56,740 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-14 23:15:56,742 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:15:56,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 23:15:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 23:15:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:15:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-10-14 23:15:56,755 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 27 [2024-10-14 23:15:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-10-14 23:15:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-14 23:15:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-10-14 23:15:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 23:15:56,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 23:15:56,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1388931551, now seen corresponding path program 1 times [2024-10-14 23:15:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256083436] [2024-10-14 23:15:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,831 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-14 23:15:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256083436] [2024-10-14 23:15:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256083436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901060799] [2024-10-14 23:15:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,836 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:15:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,861 INFO L93 Difference]: Finished difference Result 87 states and 121 transitions. [2024-10-14 23:15:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 23:15:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,863 INFO L225 Difference]: With dead ends: 87 [2024-10-14 23:15:56,863 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 23:15:56,864 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-14 23:15:56,864 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 215 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-14 23:15:56,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 215 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 23:15:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 23:15:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:15:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-10-14 23:15:56,871 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 28 [2024-10-14 23:15:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,871 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-10-14 23:15:56,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:15:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-10-14 23:15:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 23:15:56,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:15:56,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 23:15:56,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 23:15:56,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:15:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash 107205392, now seen corresponding path program 1 times [2024-10-14 23:15:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:15:56,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038624488] [2024-10-14 23:15:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:15:56,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:15:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:15:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:15:56,933 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-14 23:15:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:15:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038624488] [2024-10-14 23:15:56,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038624488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:15:56,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:15:56,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:15:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413410972] [2024-10-14 23:15:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:15:56,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:15:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:15:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:15:56,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:15:56,936 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:15:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:15:56,952 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2024-10-14 23:15:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:15:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-14 23:15:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:15:56,953 INFO L225 Difference]: With dead ends: 86 [2024-10-14 23:15:56,953 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 23:15:56,955 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-14 23:15:56,956 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:15:56,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:15:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 23:15:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 23:15:56,958 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-14 23:15:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 23:15:56,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-14 23:15:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:15:56,959 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 23:15:56,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:15:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 23:15:56,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 23:15:56,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 23:15:56,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 23:15:56,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 23:15:56,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 23:15:56,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 23:15:56,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 23:15:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 23:15:56,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:15:56,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 23:15:56,994 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 23:15:57,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:57 BoogieIcfgContainer [2024-10-14 23:15:57,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 23:15:57,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 23:15:57,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 23:15:57,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 23:15:57,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:55" (3/4) ... [2024-10-14 23:15:57,011 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 23:15:57,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 23:15:57,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 23:15:57,019 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 23:15:57,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 23:15:57,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 23:15:57,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 23:15:57,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 23:15:57,115 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 23:15:57,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 23:15:57,116 INFO L158 Benchmark]: Toolchain (without parser) took 3430.51ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 94.5MB in the beginning and 88.5MB in the end (delta: 6.0MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,116 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:15:57,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1035.25ms. Allocated memory is still 157.3MB. Free memory was 94.0MB in the beginning and 72.6MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.53ms. Allocated memory is still 157.3MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,117 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 157.3MB. Free memory was 69.2MB in the beginning and 66.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,118 INFO L158 Benchmark]: RCFGBuilder took 699.32ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 66.4MB in the beginning and 141.4MB in the end (delta: -75.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,118 INFO L158 Benchmark]: TraceAbstraction took 1472.61ms. Allocated memory is still 190.8MB. Free memory was 141.4MB in the beginning and 94.7MB in the end (delta: 46.7MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,118 INFO L158 Benchmark]: Witness Printer took 108.05ms. Allocated memory is still 190.8MB. Free memory was 94.7MB in the beginning and 88.5MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 23:15:57,120 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.17ms. Allocated memory is still 102.8MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1035.25ms. Allocated memory is still 157.3MB. Free memory was 94.0MB in the beginning and 72.6MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.53ms. Allocated memory is still 157.3MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 157.3MB. Free memory was 69.2MB in the beginning and 66.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 699.32ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 66.4MB in the beginning and 141.4MB in the end (delta: -75.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1472.61ms. Allocated memory is still 190.8MB. Free memory was 141.4MB in the beginning and 94.7MB in the end (delta: 46.7MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 108.05ms. Allocated memory is still 190.8MB. Free memory was 94.7MB in the beginning and 88.5MB in the end (delta: 6.2MB). 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: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: 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, 91 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 1525 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 742 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 783 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 23:15:57,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE