./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c --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/termination-numeric/java_LogBuiltIn.c -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 6d6de59cf2b416f7340c8c861064933450d6034e9a050a1b7fe5107e8fa4152f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:17:52,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:17:52,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:17:53,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:17:53,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:17:53,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:17:53,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:17:53,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:17:53,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:17:53,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:17:53,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:17:53,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:17:53,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:17:53,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:17:53,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:17:53,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:17:53,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:17:53,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:17:53,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:17:53,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:17:53,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:17:53,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:17:53,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:17:53,047 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:17:53,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:17:53,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:17:53,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:17:53,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:17:53,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:17:53,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:17:53,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:17:53,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:17:53,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:17:53,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:17:53,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:17:53,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:17:53,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:17:53,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:17:53,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:17:53,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:17:53,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:17:53,052 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 -> 6d6de59cf2b416f7340c8c861064933450d6034e9a050a1b7fe5107e8fa4152f [2024-10-11 20:17:53,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:17:53,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:17:53,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:17:53,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:17:53,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:17:53,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c [2024-10-11 20:17:54,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:17:54,808 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:17:54,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/java_LogBuiltIn.c [2024-10-11 20:17:54,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6e1e5cfc/923ce569cd894f289be64752b823febd/FLAGe104da222 [2024-10-11 20:17:55,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6e1e5cfc/923ce569cd894f289be64752b823febd [2024-10-11 20:17:55,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:17:55,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:17:55,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:17:55,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:17:55,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:17:55,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225d8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55, skipping insertion in model container [2024-10-11 20:17:55,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:17:55,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:17:55,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:17:55,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:17:55,413 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:17:55,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55 WrapperNode [2024-10-11 20:17:55,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:17:55,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:17:55,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:17:55,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:17:55,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,442 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2024-10-11 20:17:55,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:17:55,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:17:55,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:17:55,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:17:55,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,460 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:17:55,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:17:55,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:17:55,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:17:55,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:17:55,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (1/1) ... [2024-10-11 20:17:55,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:17:55,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:17:55,497 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 20:17:55,502 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 20:17:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:17:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:17:55,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:17:55,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:17:55,667 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 20:17:55,667 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:17:55,688 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:17:55,688 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:17:55,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:17:55 BoogieIcfgContainer [2024-10-11 20:17:55,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:17:55,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:17:55,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:17:55,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:17:55,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:17:55" (1/3) ... [2024-10-11 20:17:55,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc92ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:17:55, skipping insertion in model container [2024-10-11 20:17:55,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:17:55" (2/3) ... [2024-10-11 20:17:55,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc92ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:17:55, skipping insertion in model container [2024-10-11 20:17:55,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:17:55" (3/3) ... [2024-10-11 20:17:55,695 INFO L112 eAbstractionObserver]: Analyzing ICFG java_LogBuiltIn.c [2024-10-11 20:17:55,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:17:55,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:17:55,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:17:55,757 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;@a2db3ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:17:55,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:17:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 11 states have internal predecessors, (13), 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 20:17:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:17:55,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:55,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:17:55,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 59935, now seen corresponding path program 1 times [2024-10-11 20:17:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707053520] [2024-10-11 20:17:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:55,946 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 20:17:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707053520] [2024-10-11 20:17:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707053520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:17:55,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:17:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:17:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755865136] [2024-10-11 20:17:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:17:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:17:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:17:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:17:55,979 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 11 states have internal predecessors, (13), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 20:17:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:56,004 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 20:17:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:17:56,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-10-11 20:17:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:56,011 INFO L225 Difference]: With dead ends: 14 [2024-10-11 20:17:56,011 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 20:17:56,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:17:56,016 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:56,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:17:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 20:17:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-11 20:17:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 6 states have (on average 1.5) internal successors, (9), 8 states have internal predecessors, (9), 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 20:17:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-11 20:17:56,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 3 [2024-10-11 20:17:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:56,038 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-11 20:17:56,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 20:17:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-11 20:17:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:17:56,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:56,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:17:56,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:17:56,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1858030, now seen corresponding path program 1 times [2024-10-11 20:17:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257495435] [2024-10-11 20:17:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:56,230 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 20:17:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257495435] [2024-10-11 20:17:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257495435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:17:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:17:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:17:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543792599] [2024-10-11 20:17:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:17:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:17:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:17:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:17:56,237 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 20:17:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:56,254 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2024-10-11 20:17:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:17:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-10-11 20:17:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:56,255 INFO L225 Difference]: With dead ends: 9 [2024-10-11 20:17:56,256 INFO L226 Difference]: Without dead ends: 8 [2024-10-11 20:17:56,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:17:56,257 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:56,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:17:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-11 20:17:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-11 20:17:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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 20:17:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 20:17:56,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 20:17:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 20:17:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 20:17:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 20:17:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:17:56,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:56,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:17:56,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:17:56,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 57598977, now seen corresponding path program 1 times [2024-10-11 20:17:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088422423] [2024-10-11 20:17:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:56,302 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 20:17:56,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088422423] [2024-10-11 20:17:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088422423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:17:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:17:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:17:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341607977] [2024-10-11 20:17:56,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:17:56,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:17:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:17:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:17:56,306 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 20:17:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:56,320 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2024-10-11 20:17:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:17:56,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-10-11 20:17:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:56,321 INFO L225 Difference]: With dead ends: 8 [2024-10-11 20:17:56,321 INFO L226 Difference]: Without dead ends: 7 [2024-10-11 20:17:56,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 20:17:56,322 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:56,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:17:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-10-11 20:17:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-11 20:17:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 20:17:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-11 20:17:56,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-10-11 20:17:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:56,328 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-11 20:17:56,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 20:17:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-10-11 20:17:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:17:56,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:56,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:17:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:17:56,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1785568336, now seen corresponding path program 1 times [2024-10-11 20:17:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596281749] [2024-10-11 20:17:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:56,381 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 20:17:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596281749] [2024-10-11 20:17:56,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596281749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:17:56,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:17:56,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:17:56,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158422244] [2024-10-11 20:17:56,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:17:56,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:17:56,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:56,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:17:56,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:17:56,383 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 20:17:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:56,402 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 20:17:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:17:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-10-11 20:17:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:56,402 INFO L225 Difference]: With dead ends: 13 [2024-10-11 20:17:56,402 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 20:17:56,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 20:17:56,403 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 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 20:17:56,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:17:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 20:17:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 20:17:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 20:17:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-10-11 20:17:56,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2024-10-11 20:17:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:56,409 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-10-11 20:17:56,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 20:17:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-10-11 20:17:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:17:56,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:56,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:17:56,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:17:56,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:56,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -796027875, now seen corresponding path program 1 times [2024-10-11 20:17:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378418149] [2024-10-11 20:17:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378418149] [2024-10-11 20:17:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378418149] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:17:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674843056] [2024-10-11 20:17:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:17:56,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:17:56,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:17:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:56,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:17:56,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:17:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:56,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:17:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674843056] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:17:56,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:17:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-11 20:17:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049790273] [2024-10-11 20:17:56,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:17:56,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:17:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:17:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:17:56,633 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:17:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:56,665 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-10-11 20:17:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:17:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) Word has length 11 [2024-10-11 20:17:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:56,666 INFO L225 Difference]: With dead ends: 28 [2024-10-11 20:17:56,666 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:17:56,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:17:56,667 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:56,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:17:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:17:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:17:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 20:17:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-11 20:17:56,670 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2024-10-11 20:17:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-11 20:17:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 20:17:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-11 20:17:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:17:56,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:56,671 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1] [2024-10-11 20:17:56,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:17:56,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:56,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:56,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash -964844400, now seen corresponding path program 2 times [2024-10-11 20:17:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:56,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661548486] [2024-10-11 20:17:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661548486] [2024-10-11 20:17:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661548486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:17:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381208105] [2024-10-11 20:17:57,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:17:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:17:57,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:17:57,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:17:57,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:17:57,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:17:57,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:17:57,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:17:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:57,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:17:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381208105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:17:57,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:17:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-11 20:17:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977671411] [2024-10-11 20:17:57,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:17:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 20:17:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 20:17:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:17:57,321 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 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 20:17:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:57,390 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-11 20:17:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 20:17:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 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) Word has length 26 [2024-10-11 20:17:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:57,391 INFO L225 Difference]: With dead ends: 58 [2024-10-11 20:17:57,391 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 20:17:57,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:17:57,394 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:57,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:17:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 20:17:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-11 20:17:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 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 20:17:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-10-11 20:17:57,399 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 26 [2024-10-11 20:17:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:57,399 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-10-11 20:17:57,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 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 20:17:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-10-11 20:17:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 20:17:57,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:57,401 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1] [2024-10-11 20:17:57,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:17:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:57,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2013772560, now seen corresponding path program 3 times [2024-10-11 20:17:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443177967] [2024-10-11 20:17:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:17:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:17:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443177967] [2024-10-11 20:17:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443177967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:17:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49733228] [2024-10-11 20:17:58,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:17:58,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:58,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:17:58,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:17:58,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:17:58,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:17:58,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:17:58,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 20:17:58,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:17:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:58,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:17:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:17:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49733228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:17:58,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:17:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2024-10-11 20:17:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974294348] [2024-10-11 20:17:58,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:17:58,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-11 20:17:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:17:58,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-11 20:17:58,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:17:58,715 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 46 states, 45 states have (on average 2.488888888888889) internal successors, (112), 45 states have internal predecessors, (112), 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 20:17:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:17:58,817 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2024-10-11 20:17:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 20:17:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.488888888888889) internal successors, (112), 45 states have internal predecessors, (112), 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) Word has length 56 [2024-10-11 20:17:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:17:58,819 INFO L225 Difference]: With dead ends: 118 [2024-10-11 20:17:58,819 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 20:17:58,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:17:58,820 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:17:58,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:17:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 20:17:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 20:17:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 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 20:17:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2024-10-11 20:17:58,828 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 56 [2024-10-11 20:17:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:17:58,829 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2024-10-11 20:17:58,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.488888888888889) internal successors, (112), 45 states have internal predecessors, (112), 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 20:17:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2024-10-11 20:17:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 20:17:58,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:17:58,831 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1] [2024-10-11 20:17:58,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:17:59,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:17:59,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:17:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:17:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2068630960, now seen corresponding path program 4 times [2024-10-11 20:17:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:17:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324980845] [2024-10-11 20:17:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:17:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:17:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:18:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:18:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:18:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324980845] [2024-10-11 20:18:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324980845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:18:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331851678] [2024-10-11 20:18:00,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:18:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:18:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:18:00,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:18:00,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:18:00,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:18:00,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:18:00,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 20:18:00,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:18:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:18:00,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:18:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:18:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331851678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:18:02,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:18:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 92 [2024-10-11 20:18:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278368698] [2024-10-11 20:18:02,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:18:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-11 20:18:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:18:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-11 20:18:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 20:18:02,879 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand has 94 states, 93 states have (on average 2.4946236559139785) internal successors, (232), 93 states have internal predecessors, (232), 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 20:18:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:18:03,079 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2024-10-11 20:18:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-11 20:18:03,079 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 2.4946236559139785) internal successors, (232), 93 states have internal predecessors, (232), 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) Word has length 116 [2024-10-11 20:18:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:18:03,081 INFO L225 Difference]: With dead ends: 238 [2024-10-11 20:18:03,081 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 20:18:03,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 20:18:03,083 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:18:03,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:18:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 20:18:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-10-11 20:18:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.0042372881355932) internal successors, (237), 236 states have internal predecessors, (237), 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 20:18:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2024-10-11 20:18:03,096 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 116 [2024-10-11 20:18:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:18:03,096 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2024-10-11 20:18:03,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 2.4946236559139785) internal successors, (232), 93 states have internal predecessors, (232), 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 20:18:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2024-10-11 20:18:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 20:18:03,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:18:03,099 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1] [2024-10-11 20:18:03,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:18:03,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:18:03,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:18:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:18:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 983236400, now seen corresponding path program 5 times [2024-10-11 20:18:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:18:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042526809] [2024-10-11 20:18:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:18:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:18:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:18:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4741 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-10-11 20:18:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:18:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042526809] [2024-10-11 20:18:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042526809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:18:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:18:10,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2024-10-11 20:18:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066736978] [2024-10-11 20:18:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:18:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-11 20:18:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:18:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-11 20:18:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 20:18:10,568 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 63 states, 63 states have (on average 2.507936507936508) internal successors, (158), 62 states have internal predecessors, (158), 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 20:18:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:18:10,837 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2024-10-11 20:18:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-11 20:18:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.507936507936508) internal successors, (158), 62 states have internal predecessors, (158), 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) Word has length 236 [2024-10-11 20:18:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:18:10,838 INFO L225 Difference]: With dead ends: 237 [2024-10-11 20:18:10,838 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:18:10,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 30 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 20:18:10,840 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:18:10,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:18:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:18:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:18:10,844 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 20:18:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:18:10,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2024-10-11 20:18:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:18:10,844 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:18:10,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.507936507936508) internal successors, (158), 62 states have internal predecessors, (158), 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 20:18:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:18:10,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:18:10,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:18:10,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:18:10,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:18:10,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:18:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:18:10,854 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-10-11 20:18:10,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:18:11,089 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:18:11,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:18:11 BoogieIcfgContainer [2024-10-11 20:18:11,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:18:11,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:18:11,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:18:11,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:18:11,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:17:55" (3/4) ... [2024-10-11 20:18:11,119 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:18:11,123 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 20:18:11,124 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:18:11,124 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:18:11,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:18:11,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:18:11,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:18:11,194 INFO L158 Benchmark]: Toolchain (without parser) took 15955.90ms. Allocated memory was 220.2MB in the beginning and 807.4MB in the end (delta: 587.2MB). Free memory was 150.4MB in the beginning and 680.6MB in the end (delta: -530.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,194 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 123.7MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.17ms. Allocated memory is still 220.2MB. Free memory was 150.3MB in the beginning and 139.3MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.14ms. Allocated memory is still 220.2MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: Boogie Preprocessor took 27.37ms. Allocated memory is still 220.2MB. Free memory was 137.7MB in the beginning and 136.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: RCFGBuilder took 217.47ms. Allocated memory is still 220.2MB. Free memory was 136.1MB in the beginning and 124.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: TraceAbstraction took 15426.57ms. Allocated memory was 220.2MB in the beginning and 807.4MB in the end (delta: 587.2MB). Free memory was 124.4MB in the beginning and 685.8MB in the end (delta: -561.5MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,195 INFO L158 Benchmark]: Witness Printer took 72.77ms. Allocated memory is still 807.4MB. Free memory was 684.8MB in the beginning and 680.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:18:11,196 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 123.7MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.17ms. Allocated memory is still 220.2MB. Free memory was 150.3MB in the beginning and 139.3MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.14ms. Allocated memory is still 220.2MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.37ms. Allocated memory is still 220.2MB. Free memory was 137.7MB in the beginning and 136.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 217.47ms. Allocated memory is still 220.2MB. Free memory was 136.1MB in the beginning and 124.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15426.57ms. Allocated memory was 220.2MB in the beginning and 807.4MB in the end (delta: 587.2MB). Free memory was 124.4MB in the beginning and 685.8MB in the end (delta: -561.5MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 72.77ms. Allocated memory is still 807.4MB. Free memory was 684.8MB in the beginning and 680.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: 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 1 procedures, 12 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 9, TraceHistogramMax: 47, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 87 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 330 SyntacticMatches, 31 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=8, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 2670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 5405/10190 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 4 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= res) && (x <= 65535)) && (res <= 15)) || (((0 <= res) && (x <= 2097151)) && (res <= 10))) || (((res <= 13) && (0 <= res)) && (x <= 262143))) || (((0 <= res) && (res <= 9)) && (x <= 4194303))) || (((x <= 16383) && (0 <= res)) && (res <= 17))) || (((0 <= res) && (x <= 7)) && (res <= 2147483629))) || (((x <= 511) && (0 <= res)) && (res <= 22))) || (((x <= 131071) && (0 <= res)) && (res <= 14))) || (((0 <= res) && (x <= 32767)) && (res <= 16))) || (((res <= 2147483628) && (0 <= res)) && (x <= 15))) || (((0 <= res) && (x <= 127)) && (res <= 2147483625))) || (((0 <= res) && (x <= 1023)) && (res <= 21))) || ((res == 0) && (x <= 2147483647))) || (((0 <= res) && (res <= 8)) && (x <= 8388607))) || (((0 <= res) && (x <= 2047)) && (res <= 20))) || (((x <= 4095) && (0 <= res)) && (res <= 19))) || (((0 <= res) && (x <= 31)) && (res <= 2147483627))) || (((0 <= res) && (x <= 255)) && (res <= 2147483624))) || (((0 <= res) && (res <= 2147483631)) && (x <= 1))) || (((0 <= res) && (x <= 268435455)) && (res <= 3))) || (((res <= 12) && (0 <= res)) && (x <= 524287))) || (((x <= 1048575) && (res <= 11)) && (0 <= res))) || (((0 <= res) && (x <= 16777215)) && (res <= 7))) || (((res <= 18) && (0 <= res)) && (x <= 8191))) || (((0 <= res) && (res <= 5)) && (x <= 67108863))) || (((0 <= res) && (res <= 4)) && (x <= 134217727))) || (((0 <= res) && (x <= 3)) && (res <= 2147483630))) || (((0 <= res) && (x <= 536870911)) && (res <= 2))) || (((0 <= res) && (res <= 6)) && (x <= 33554431))) || (((0 <= res) && (res <= 1)) && (x <= 1073741823))) || (((0 <= res) && (res <= 2147483626)) && (x <= 63))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:18:11,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE