./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:08:39,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:08:39,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:08:39,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:08:39,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:08:39,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:08:39,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:08:39,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:08:39,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:08:39,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:08:39,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:08:39,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:08:39,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:08:39,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:08:39,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:08:39,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:08:39,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:08:39,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:08:39,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:08:39,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:08:39,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:08:39,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:08:39,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:08:39,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:08:39,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:08:39,183 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:08:39,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:08:39,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:08:39,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:08:39,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:08:39,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:08:39,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:08:39,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:08:39,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:08:39,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:08:39,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:08:39,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:08:39,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:08:39,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:08:39,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:08:39,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:08:39,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:08:39,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:08:39,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:08:39,194 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2024-10-14 20:08:39,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:08:39,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:08:39,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:08:39,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:08:39,461 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:08:39,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2024-10-14 20:08:40,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:08:41,012 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:08:41,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2024-10-14 20:08:41,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03082cd04/a970613259704e36ae1db2e4a10e031f/FLAG3864311b0 [2024-10-14 20:08:41,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03082cd04/a970613259704e36ae1db2e4a10e031f [2024-10-14 20:08:41,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:08:41,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:08:41,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:08:41,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:08:41,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:08:41,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712430cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41, skipping insertion in model container [2024-10-14 20:08:41,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:08:41,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:08:41,646 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:08:41,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:08:41,698 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:08:41,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41 WrapperNode [2024-10-14 20:08:41,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:08:41,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:08:41,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:08:41,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:08:41,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,732 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 150 [2024-10-14 20:08:41,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:08:41,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:08:41,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:08:41,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:08:41,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:08:41,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:08:41,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:08:41,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:08:41,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:08:41,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (1/1) ... [2024-10-14 20:08:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:08:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:41,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:08:41,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:08:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:08:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:08:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:08:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:08:41,889 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:08:41,890 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:08:42,079 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-14 20:08:42,079 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:08:42,117 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:08:42,118 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:08:42,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:08:42 BoogieIcfgContainer [2024-10-14 20:08:42,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:08:42,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:08:42,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:08:42,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:08:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:08:41" (1/3) ... [2024-10-14 20:08:42,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74062a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:08:42, skipping insertion in model container [2024-10-14 20:08:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:08:41" (2/3) ... [2024-10-14 20:08:42,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74062a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:08:42, skipping insertion in model container [2024-10-14 20:08:42,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:08:42" (3/3) ... [2024-10-14 20:08:42,131 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2024-10-14 20:08:42,148 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:08:42,148 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 20:08:42,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:08:42,227 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;@a8d39c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:08:42,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 20:08:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 48 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 20:08:42,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:42,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:42,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1680218245, now seen corresponding path program 1 times [2024-10-14 20:08:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041453187] [2024-10-14 20:08:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:08:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041453187] [2024-10-14 20:08:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041453187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:42,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:08:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857753204] [2024-10-14 20:08:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,443 INFO L87 Difference]: Start difference. First operand has 49 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 48 states have internal predecessors, (78), 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, 3 states have (on average 3.0) internal successors, (9), 2 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-14 20:08:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:42,524 INFO L93 Difference]: Finished difference Result 100 states and 162 transitions. [2024-10-14 20:08:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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) Word has length 9 [2024-10-14 20:08:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:42,535 INFO L225 Difference]: With dead ends: 100 [2024-10-14 20:08:42,535 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 20:08:42,538 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-14 20:08:42,541 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:42,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 20:08:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 20:08:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 47 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-14 20:08:42,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 9 [2024-10-14 20:08:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:42,570 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-14 20:08:42,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-14 20:08:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-14 20:08:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:08:42,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:42,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:08:42,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1163930581, now seen corresponding path program 1 times [2024-10-14 20:08:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134186575] [2024-10-14 20:08:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:08:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134186575] [2024-10-14 20:08:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134186575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:08:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911755801] [2024-10-14 20:08:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:42,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,632 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:42,719 INFO L93 Difference]: Finished difference Result 99 states and 147 transitions. [2024-10-14 20:08:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-14 20:08:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:42,721 INFO L225 Difference]: With dead ends: 99 [2024-10-14 20:08:42,721 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 20:08:42,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,723 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:42,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 20:08:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 20:08:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-14 20:08:42,738 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 14 [2024-10-14 20:08:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:42,738 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-14 20:08:42,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-14 20:08:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:08:42,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:42,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:42,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:08:42,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:42,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1546344187, now seen corresponding path program 1 times [2024-10-14 20:08:42,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:42,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243070158] [2024-10-14 20:08:42,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 20:08:42,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:42,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243070158] [2024-10-14 20:08:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243070158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:42,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:42,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:08:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473362458] [2024-10-14 20:08:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:42,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:42,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:42,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,815 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:42,886 INFO L93 Difference]: Finished difference Result 108 states and 157 transitions. [2024-10-14 20:08:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-10-14 20:08:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:42,887 INFO L225 Difference]: With dead ends: 108 [2024-10-14 20:08:42,888 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 20:08:42,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,891 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:42,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 20:08:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-14 20:08:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 56 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2024-10-14 20:08:42,899 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 20 [2024-10-14 20:08:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2024-10-14 20:08:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-10-14 20:08:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 20:08:42,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:42,902 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:08:42,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:42,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 866285817, now seen corresponding path program 1 times [2024-10-14 20:08:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839784883] [2024-10-14 20:08:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 20:08:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839784883] [2024-10-14 20:08:42,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839784883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:08:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356616911] [2024-10-14 20:08:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:42,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:42,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:42,966 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:43,051 INFO L93 Difference]: Finished difference Result 127 states and 184 transitions. [2024-10-14 20:08:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-10-14 20:08:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:43,053 INFO L225 Difference]: With dead ends: 127 [2024-10-14 20:08:43,053 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 20:08:43,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:43,055 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:43,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 20:08:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-14 20:08:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 68 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2024-10-14 20:08:43,068 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 20 [2024-10-14 20:08:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2024-10-14 20:08:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2024-10-14 20:08:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 20:08:43,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:43,069 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:08:43,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1457392399, now seen corresponding path program 1 times [2024-10-14 20:08:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131436774] [2024-10-14 20:08:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 20:08:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131436774] [2024-10-14 20:08:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131436774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:08:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945768878] [2024-10-14 20:08:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:43,145 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:43,208 INFO L93 Difference]: Finished difference Result 143 states and 193 transitions. [2024-10-14 20:08:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 25 [2024-10-14 20:08:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:43,210 INFO L225 Difference]: With dead ends: 143 [2024-10-14 20:08:43,210 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 20:08:43,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:43,211 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:43,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:08:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 20:08:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 20:08:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 74 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-10-14 20:08:43,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 25 [2024-10-14 20:08:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:43,219 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-10-14 20:08:43,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-10-14 20:08:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:08:43,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:43,221 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:43,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:08:43,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash 11757398, now seen corresponding path program 1 times [2024-10-14 20:08:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:43,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476487251] [2024-10-14 20:08:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 20:08:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476487251] [2024-10-14 20:08:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476487251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:08:43,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:08:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:08:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734735516] [2024-10-14 20:08:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:08:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:08:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:08:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:43,294 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:43,335 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2024-10-14 20:08:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:08:43,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 31 [2024-10-14 20:08:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:43,336 INFO L225 Difference]: With dead ends: 75 [2024-10-14 20:08:43,336 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 20:08:43,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:08:43,338 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:43,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 43 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:08:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 20:08:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 20:08:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 71 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-10-14 20:08:43,349 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 31 [2024-10-14 20:08:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:43,350 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-10-14 20:08:43,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:08:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-10-14 20:08:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 20:08:43,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:43,351 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:43,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:08:43,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:08:43,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 364479474, now seen corresponding path program 1 times [2024-10-14 20:08:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671655685] [2024-10-14 20:08:43,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:08:43,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 20:08:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:08:43,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 20:08:43,430 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 20:08:43,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 20:08:43,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 20:08:43,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 20:08:43,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 20:08:43,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 20:08:43,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 20:08:43,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:08:43,439 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:08:43,482 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:08:43,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:08:43 BoogieIcfgContainer [2024-10-14 20:08:43,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:08:43,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:08:43,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:08:43,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:08:43,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:08:42" (3/4) ... [2024-10-14 20:08:43,488 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 20:08:43,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:08:43,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:08:43,560 INFO L158 Benchmark]: Toolchain (without parser) took 2151.83ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 139.4MB in the end (delta: -32.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:08:43,561 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 104.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:08:43,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.34ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 146.3MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:08:43,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:08:43,561 INFO L158 Benchmark]: Boogie Preprocessor took 36.46ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:08:43,561 INFO L158 Benchmark]: RCFGBuilder took 351.39ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 126.7MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 20:08:43,562 INFO L158 Benchmark]: TraceAbstraction took 1361.82ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 142.5MB in the end (delta: -16.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:08:43,562 INFO L158 Benchmark]: Witness Printer took 73.33ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 139.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:08:43,563 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.90ms. Allocated memory is still 104.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.34ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 146.3MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.46ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.39ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 126.7MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1361.82ms. Allocated memory is still 176.2MB. Free memory was 126.0MB in the beginning and 142.5MB in the end (delta: -16.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.33ms. Allocated memory is still 176.2MB. Free memory was 142.5MB in the beginning and 139.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__verify_mode = __VERIFIER_nondet_int() ; [L24] int s__session__peer = __VERIFIER_nondet_int() ; [L25] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L26] int buf ; [L27] int cb ; [L28] int blastFlag ; [L29] int tmp___1; [L31] s__state = 8466 [L32] blastFlag = 0 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L41] COND TRUE s__state == 8466 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L90] COND TRUE blastFlag == 0 [L91] blastFlag = 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L93] s__state = 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L44] COND TRUE s__state == 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L97] COND TRUE blastFlag == 1 [L98] blastFlag = 2 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L100] COND FALSE !(\read(s__hit)) [L103] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L48] COND TRUE s__state == 8512 [L108] s__state = 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L52] COND TRUE s__state == 8528 [L112] s__state = 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L52] COND FALSE !(s__state == 8528) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L56] COND TRUE s__state == 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L116] s__verify_mode + 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0] - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 341 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 85/85 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-14 20:08:43,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)