./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/array-multidimensional/max-3-n-u.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 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:02:08,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:02:08,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:02:08,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:02:08,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:02:08,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:02:08,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:02:08,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:02:08,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:02:08,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:02:08,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:02:08,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:02:08,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:02:08,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:02:08,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:02:08,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:02:08,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:02:08,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:02:08,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:02:08,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:02:08,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:02:08,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:02:08,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:02:08,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:02:08,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:02:08,142 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:02:08,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:02:08,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:02:08,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:02:08,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:02:08,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:02:08,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:02:08,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:02:08,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:02:08,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:02:08,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:02:08,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:02:08,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:02:08,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:02:08,149 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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2024-11-19 10:02:08,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:02:08,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:02:08,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:02:08,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:02:08,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:02:08,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2024-11-19 10:02:09,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:02:09,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:02:09,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2024-11-19 10:02:09,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c0c6eb6/343eb225041749889997e03ee009f541/FLAGd2643166f [2024-11-19 10:02:09,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c0c6eb6/343eb225041749889997e03ee009f541 [2024-11-19 10:02:09,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:02:09,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:02:09,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:02:09,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:02:09,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:02:09,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:02:09" (1/1) ... [2024-11-19 10:02:09,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e7b9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:09, skipping insertion in model container [2024-11-19 10:02:09,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:02:09" (1/1) ... [2024-11-19 10:02:09,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:02:10,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:02:10,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:02:10,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:02:10,197 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:02:10,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10 WrapperNode [2024-11-19 10:02:10,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:02:10,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:02:10,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:02:10,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:02:10,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,237 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2024-11-19 10:02:10,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:02:10,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:02:10,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:02:10,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:02:10,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,266 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-19 10:02:10,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:02:10,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:02:10,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:02:10,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:02:10,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (1/1) ... [2024-11-19 10:02:10,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:02:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:10,314 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-11-19 10:02:10,320 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-11-19 10:02:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:02:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:02:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:02:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:02:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:02:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:02:10,423 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:02:10,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:02:10,603 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 10:02:10,604 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:02:10,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:02:10,618 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 10:02:10,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:02:10 BoogieIcfgContainer [2024-11-19 10:02:10,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:02:10,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:02:10,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:02:10,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:02:10,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:02:09" (1/3) ... [2024-11-19 10:02:10,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4a8240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:02:10, skipping insertion in model container [2024-11-19 10:02:10,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:10" (2/3) ... [2024-11-19 10:02:10,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4a8240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:02:10, skipping insertion in model container [2024-11-19 10:02:10,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:02:10" (3/3) ... [2024-11-19 10:02:10,626 INFO L112 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2024-11-19 10:02:10,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:02:10,639 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-19 10:02:10,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:02:10,687 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;@62fbf2aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:02:10,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-19 10:02:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 57 states have internal predecessors, (77), 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-11-19 10:02:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:02:10,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:10,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:02:10,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 28699906, now seen corresponding path program 1 times [2024-11-19 10:02:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009290729] [2024-11-19 10:02:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:10,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009290729] [2024-11-19 10:02:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009290729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:02:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:02:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:02:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222948038] [2024-11-19 10:02:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:02:10,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:02:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:02:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:02:10,970 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 57 states have internal predecessors, (77), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-19 10:02:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:11,065 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2024-11-19 10:02:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:02:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-19 10:02:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:11,080 INFO L225 Difference]: With dead ends: 141 [2024-11-19 10:02:11,082 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:02:11,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:02:11,088 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:11,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:02:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:02:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-19 10:02:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 72 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-11-19 10:02:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-11-19 10:02:11,134 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 5 [2024-11-19 10:02:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-11-19 10:02:11,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-19 10:02:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-11-19 10:02:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:02:11,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:11,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:02:11,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:02:11,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:11,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash 889698573, now seen corresponding path program 1 times [2024-11-19 10:02:11,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337946483] [2024-11-19 10:02:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337946483] [2024-11-19 10:02:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337946483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:02:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:02:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:02:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096980438] [2024-11-19 10:02:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:02:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:02:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:02:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:02:11,265 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.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-11-19 10:02:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:11,335 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2024-11-19 10:02:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:02:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-11-19 10:02:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:11,336 INFO L225 Difference]: With dead ends: 103 [2024-11-19 10:02:11,337 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 10:02:11,338 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-11-19 10:02:11,339 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:11,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:02:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 10:02:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 10:02:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 96 states have internal predecessors, (124), 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-11-19 10:02:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2024-11-19 10:02:11,353 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 6 [2024-11-19 10:02:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:11,353 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2024-11-19 10:02:11,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-11-19 10:02:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2024-11-19 10:02:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:02:11,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:11,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:02:11,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:11,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash 765434955, now seen corresponding path program 1 times [2024-11-19 10:02:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529609637] [2024-11-19 10:02:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529609637] [2024-11-19 10:02:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529609637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:02:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:02:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:02:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912424281] [2024-11-19 10:02:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:02:11,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:02:11,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:02:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:02:11,485 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-11-19 10:02:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:11,552 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. [2024-11-19 10:02:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:02:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-11-19 10:02:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:11,553 INFO L225 Difference]: With dead ends: 192 [2024-11-19 10:02:11,553 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 10:02:11,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:02:11,554 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:11,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 87 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:02:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 10:02:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 10:02:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 96 states have internal predecessors, (118), 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-11-19 10:02:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-19 10:02:11,575 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 9 [2024-11-19 10:02:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:11,575 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-19 10:02:11,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-11-19 10:02:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-19 10:02:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:02:11,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:11,576 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:11,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:02:11,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:11,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash 767067060, now seen corresponding path program 1 times [2024-11-19 10:02:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622431330] [2024-11-19 10:02:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:11,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622431330] [2024-11-19 10:02:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622431330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713656713] [2024-11-19 10:02:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:11,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:11,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:02:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:11,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:02:11,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:11,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:02:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713656713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:02:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:02:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 10:02:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750114691] [2024-11-19 10:02:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:02:11,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:02:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:02:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:02:11,782 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-19 10:02:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:11,837 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2024-11-19 10:02:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:02:11,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-19 10:02:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:11,838 INFO L225 Difference]: With dead ends: 97 [2024-11-19 10:02:11,838 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 10:02:11,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:02:11,839 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:11,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:02:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 10:02:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-19 10:02:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 93 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-11-19 10:02:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2024-11-19 10:02:11,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2024-11-19 10:02:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:11,847 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2024-11-19 10:02:11,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-19 10:02:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2024-11-19 10:02:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:02:11,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:11,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:11,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:02:12,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:12,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1990724853, now seen corresponding path program 1 times [2024-11-19 10:02:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502211376] [2024-11-19 10:02:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502211376] [2024-11-19 10:02:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502211376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131501122] [2024-11-19 10:02:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:12,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:12,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:02:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:12,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:02:12,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:12,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:02:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131501122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:12,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-19 10:02:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731349094] [2024-11-19 10:02:12,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:12,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:02:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:02:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:02:12,228 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-11-19 10:02:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:12,319 INFO L93 Difference]: Finished difference Result 169 states and 226 transitions. [2024-11-19 10:02:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:02:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 10 [2024-11-19 10:02:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:12,321 INFO L225 Difference]: With dead ends: 169 [2024-11-19 10:02:12,322 INFO L226 Difference]: Without dead ends: 166 [2024-11-19 10:02:12,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:02:12,323 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:12,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:02:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-19 10:02:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-19 10:02:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.3774834437086092) internal successors, (208), 165 states have internal predecessors, (208), 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-11-19 10:02:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2024-11-19 10:02:12,335 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 10 [2024-11-19 10:02:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:12,335 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2024-11-19 10:02:12,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-11-19 10:02:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2024-11-19 10:02:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:02:12,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:12,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:12,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:02:12,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:12,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1827767228, now seen corresponding path program 1 times [2024-11-19 10:02:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810129742] [2024-11-19 10:02:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:02:12,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810129742] [2024-11-19 10:02:12,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810129742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:02:12,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:02:12,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:02:12,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225011852] [2024-11-19 10:02:12,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:02:12,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:02:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:02:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:02:12,569 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-19 10:02:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:12,622 INFO L93 Difference]: Finished difference Result 328 states and 412 transitions. [2024-11-19 10:02:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:02:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) Word has length 12 [2024-11-19 10:02:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:12,624 INFO L225 Difference]: With dead ends: 328 [2024-11-19 10:02:12,624 INFO L226 Difference]: Without dead ends: 322 [2024-11-19 10:02:12,625 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-11-19 10:02:12,626 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:12,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:02:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-19 10:02:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2024-11-19 10:02:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 298 states have (on average 1.3624161073825503) internal successors, (406), 312 states have internal predecessors, (406), 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-11-19 10:02:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 406 transitions. [2024-11-19 10:02:12,645 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 406 transitions. Word has length 12 [2024-11-19 10:02:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 406 transitions. [2024-11-19 10:02:12,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-11-19 10:02:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 406 transitions. [2024-11-19 10:02:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:02:12,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:12,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:12,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:02:12,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 903061951, now seen corresponding path program 1 times [2024-11-19 10:02:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012389686] [2024-11-19 10:02:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:02:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012389686] [2024-11-19 10:02:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012389686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279127355] [2024-11-19 10:02:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:12,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:12,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:12,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:02:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:12,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:02:12,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:02:12,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:02:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279127355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:12,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2024-11-19 10:02:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394183557] [2024-11-19 10:02:12,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:12,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:02:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:02:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:02:12,804 INFO L87 Difference]: Start difference. First operand 313 states and 406 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-11-19 10:02:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:13,099 INFO L93 Difference]: Finished difference Result 607 states and 787 transitions. [2024-11-19 10:02:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 10:02:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 16 [2024-11-19 10:02:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:13,104 INFO L225 Difference]: With dead ends: 607 [2024-11-19 10:02:13,104 INFO L226 Difference]: Without dead ends: 313 [2024-11-19 10:02:13,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 10:02:13,107 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 379 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:13,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 129 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:02:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-19 10:02:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-19 10:02:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 298 states have (on average 1.221476510067114) internal successors, (364), 309 states have internal predecessors, (364), 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-11-19 10:02:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 364 transitions. [2024-11-19 10:02:13,128 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 364 transitions. Word has length 16 [2024-11-19 10:02:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 364 transitions. [2024-11-19 10:02:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-11-19 10:02:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 364 transitions. [2024-11-19 10:02:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:02:13,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:13,130 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2024-11-19 10:02:13,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:02:13,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:13,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:13,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1756482670, now seen corresponding path program 2 times [2024-11-19 10:02:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:13,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136774297] [2024-11-19 10:02:13,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:13,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:13,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:02:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136774297] [2024-11-19 10:02:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136774297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504352378] [2024-11-19 10:02:13,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:13,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:13,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:02:13,450 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:13,450 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:13,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:02:13,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:02:13,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 10:02:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504352378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:13,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:13,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 10:02:13,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418272770] [2024-11-19 10:02:13,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:02:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:02:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:02:13,509 INFO L87 Difference]: Start difference. First operand 310 states and 364 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-19 10:02:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:13,546 INFO L93 Difference]: Finished difference Result 310 states and 364 transitions. [2024-11-19 10:02:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:02:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2024-11-19 10:02:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:13,548 INFO L225 Difference]: With dead ends: 310 [2024-11-19 10:02:13,548 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 10:02:13,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:02:13,549 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 112 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:13,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 73 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:02:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 10:02:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 271. [2024-11-19 10:02:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 262 states have (on average 1.1908396946564885) internal successors, (312), 270 states have internal predecessors, (312), 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-11-19 10:02:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 312 transitions. [2024-11-19 10:02:13,565 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 312 transitions. Word has length 19 [2024-11-19 10:02:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:13,566 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 312 transitions. [2024-11-19 10:02:13,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-11-19 10:02:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 312 transitions. [2024-11-19 10:02:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 10:02:13,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:13,569 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:02:13,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:02:13,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:13,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 211563321, now seen corresponding path program 1 times [2024-11-19 10:02:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:13,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611176584] [2024-11-19 10:02:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 10:02:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611176584] [2024-11-19 10:02:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611176584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624246542] [2024-11-19 10:02:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:13,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:13,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:02:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:13,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:02:13,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:02:14,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:02:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624246542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:14,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2024-11-19 10:02:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072611795] [2024-11-19 10:02:14,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 10:02:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 10:02:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-19 10:02:14,071 INFO L87 Difference]: Start difference. First operand 271 states and 312 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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-11-19 10:02:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:14,649 INFO L93 Difference]: Finished difference Result 1077 states and 1327 transitions. [2024-11-19 10:02:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 10:02:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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) Word has length 35 [2024-11-19 10:02:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:14,652 INFO L225 Difference]: With dead ends: 1077 [2024-11-19 10:02:14,652 INFO L226 Difference]: Without dead ends: 823 [2024-11-19 10:02:14,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 10:02:14,654 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1266 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:14,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 212 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:02:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-11-19 10:02:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2024-11-19 10:02:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 814 states have (on average 1.1302211302211302) internal successors, (920), 822 states have internal predecessors, (920), 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-11-19 10:02:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 920 transitions. [2024-11-19 10:02:14,679 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 920 transitions. Word has length 35 [2024-11-19 10:02:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 920 transitions. [2024-11-19 10:02:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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-11-19 10:02:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 920 transitions. [2024-11-19 10:02:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 10:02:14,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:14,681 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:02:14,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:02:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:14,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:14,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1060936811, now seen corresponding path program 1 times [2024-11-19 10:02:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321821555] [2024-11-19 10:02:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-19 10:02:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321821555] [2024-11-19 10:02:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321821555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463247327] [2024-11-19 10:02:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:15,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:15,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:15,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:02:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:15,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:02:15,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-19 10:02:15,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-19 10:02:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463247327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:15,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:15,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 14, 14] total 28 [2024-11-19 10:02:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194633348] [2024-11-19 10:02:15,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:15,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 10:02:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 10:02:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2024-11-19 10:02:15,466 INFO L87 Difference]: Start difference. First operand 823 states and 920 transitions. Second operand has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-11-19 10:02:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:16,932 INFO L93 Difference]: Finished difference Result 2475 states and 2955 transitions. [2024-11-19 10:02:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-19 10:02:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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 77 [2024-11-19 10:02:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:16,945 INFO L225 Difference]: With dead ends: 2475 [2024-11-19 10:02:16,946 INFO L226 Difference]: Without dead ends: 1687 [2024-11-19 10:02:16,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2024-11-19 10:02:16,953 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1776 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:16,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 314 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 10:02:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-11-19 10:02:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1684. [2024-11-19 10:02:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1678 states have (on average 1.1042908224076282) internal successors, (1853), 1683 states have internal predecessors, (1853), 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-11-19 10:02:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 1853 transitions. [2024-11-19 10:02:17,047 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 1853 transitions. Word has length 77 [2024-11-19 10:02:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:17,051 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 1853 transitions. [2024-11-19 10:02:17,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-11-19 10:02:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 1853 transitions. [2024-11-19 10:02:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 10:02:17,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:17,054 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-19 10:02:17,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:02:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:17,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:17,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash 189264066, now seen corresponding path program 1 times [2024-11-19 10:02:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775429705] [2024-11-19 10:02:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2024-11-19 10:02:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775429705] [2024-11-19 10:02:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775429705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334704256] [2024-11-19 10:02:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:02:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:17,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:17,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:02:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:02:17,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 10:02:17,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 10:02:18,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 10:02:18,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334704256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:18,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 26, 26] total 52 [2024-11-19 10:02:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842934037] [2024-11-19 10:02:18,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:18,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 10:02:18,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 10:02:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 10:02:18,797 INFO L87 Difference]: Start difference. First operand 1684 states and 1853 transitions. Second operand has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-11-19 10:02:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:24,586 INFO L93 Difference]: Finished difference Result 6732 states and 8015 transitions. [2024-11-19 10:02:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-19 10:02:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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 150 [2024-11-19 10:02:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:24,600 INFO L225 Difference]: With dead ends: 6732 [2024-11-19 10:02:24,601 INFO L226 Difference]: Without dead ends: 5119 [2024-11-19 10:02:24,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2024-11-19 10:02:24,608 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6494 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6494 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:24,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6494 Valid, 253 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 10:02:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2024-11-19 10:02:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 5113. [2024-11-19 10:02:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 5107 states have (on average 1.0934012140199725) internal successors, (5584), 5112 states have internal predecessors, (5584), 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-11-19 10:02:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 5584 transitions. [2024-11-19 10:02:24,785 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 5584 transitions. Word has length 150 [2024-11-19 10:02:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:24,786 INFO L471 AbstractCegarLoop]: Abstraction has 5113 states and 5584 transitions. [2024-11-19 10:02:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-11-19 10:02:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 5584 transitions. [2024-11-19 10:02:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-11-19 10:02:24,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:24,793 INFO L215 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-19 10:02:24,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:02:24,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:24,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1261479710, now seen corresponding path program 2 times [2024-11-19 10:02:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813849356] [2024-11-19 10:02:24,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:25,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:25,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-11-19 10:02:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813849356] [2024-11-19 10:02:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813849356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781122258] [2024-11-19 10:02:25,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:25,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:25,133 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:25,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:02:25,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:25,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:25,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:02:25,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-11-19 10:02:25,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2024-11-19 10:02:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781122258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:26,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 10:02:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608656705] [2024-11-19 10:02:26,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:02:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:02:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:02:26,044 INFO L87 Difference]: Start difference. First operand 5113 states and 5584 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-19 10:02:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:26,167 INFO L93 Difference]: Finished difference Result 5113 states and 5584 transitions. [2024-11-19 10:02:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:02:26,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 429 [2024-11-19 10:02:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:26,181 INFO L225 Difference]: With dead ends: 5113 [2024-11-19 10:02:26,182 INFO L226 Difference]: Without dead ends: 5110 [2024-11-19 10:02:26,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:02:26,184 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 92 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:26,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 61 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:02:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2024-11-19 10:02:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 1735. [2024-11-19 10:02:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1732 states have (on average 1.0952655889145497) internal successors, (1897), 1734 states have internal predecessors, (1897), 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-11-19 10:02:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 1897 transitions. [2024-11-19 10:02:26,300 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 1897 transitions. Word has length 429 [2024-11-19 10:02:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 1897 transitions. [2024-11-19 10:02:26,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-19 10:02:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 1897 transitions. [2024-11-19 10:02:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-11-19 10:02:26,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:02:26,305 INFO L215 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2024-11-19 10:02:26,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:02:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 10:02:26,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:02:26,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:02:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2138629570, now seen corresponding path program 2 times [2024-11-19 10:02:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:02:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73178332] [2024-11-19 10:02:26,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:02:26,588 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:26,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-11-19 10:02:26,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:02:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73178332] [2024-11-19 10:02:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73178332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:02:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620235096] [2024-11-19 10:02:26,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:02:26,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:02:26,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:02:26,615 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:02:26,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:02:26,788 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:02:26,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:02:26,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:02:26,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:02:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-11-19 10:02:27,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:02:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2024-11-19 10:02:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620235096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:02:27,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:02:27,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 10:02:27,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511953329] [2024-11-19 10:02:27,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:02:27,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:02:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:02:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:02:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:02:27,694 INFO L87 Difference]: Start difference. First operand 1735 states and 1897 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-11-19 10:02:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:02:27,815 INFO L93 Difference]: Finished difference Result 1735 states and 1897 transitions. [2024-11-19 10:02:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:02:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 440 [2024-11-19 10:02:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:02:27,817 INFO L225 Difference]: With dead ends: 1735 [2024-11-19 10:02:27,818 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:02:27,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:02:27,822 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 92 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:02:27,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:02:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:02:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:02:27,823 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-11-19 10:02:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:02:27,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 440 [2024-11-19 10:02:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:02:27,824 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:02:27,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-11-19 10:02:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:02:27,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:02:27,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-11-19 10:02:27,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-11-19 10:02:27,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-11-19 10:02:27,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-11-19 10:02:27,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-11-19 10:02:27,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-11-19 10:02:27,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-11-19 10:02:27,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-11-19 10:02:27,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-11-19 10:02:27,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-11-19 10:02:27,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-11-19 10:02:27,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-11-19 10:02:27,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 10:02:28,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 10:02:28,043 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:02:28,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:02:40,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:02:40,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:02:40 BoogieIcfgContainer [2024-11-19 10:02:40,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:02:40,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:02:40,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:02:40,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:02:40,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:02:10" (3/4) ... [2024-11-19 10:02:40,803 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:02:40,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 10:02:40,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:02:40,810 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:02:40,811 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:02:40,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:02:40,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:02:40,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:02:40,900 INFO L158 Benchmark]: Toolchain (without parser) took 30931.60ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 120.0MB in the beginning and 847.7MB in the end (delta: -727.6MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,900 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:02:40,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 176.2MB. Free memory was 120.0MB in the beginning and 106.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 105.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,901 INFO L158 Benchmark]: Boogie Preprocessor took 45.03ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,901 INFO L158 Benchmark]: RCFGBuilder took 335.50ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 86.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,901 INFO L158 Benchmark]: TraceAbstraction took 30180.10ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 86.5MB in the beginning and 854.0MB in the end (delta: -767.4MB). Peak memory consumption was 682.1MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,902 INFO L158 Benchmark]: Witness Printer took 94.77ms. Allocated memory is still 1.2GB. Free memory was 854.0MB in the beginning and 847.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:02:40,903 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.72ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 176.2MB. Free memory was 120.0MB in the beginning and 106.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 105.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.03ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.50ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 86.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30180.10ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 86.5MB in the beginning and 854.0MB in the end (delta: -767.4MB). Peak memory consumption was 682.1MB. Max. memory is 16.1GB. * Witness Printer took 94.77ms. Allocated memory is still 1.2GB. Free memory was 854.0MB in the beginning and 847.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: 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, 58 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 13, TraceHistogramMax: 138, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10509 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10509 mSDsluCounter, 1698 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1203 mSDsCounter, 1738 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1738 mSolverCounterUnsat, 495 mSDtfsCounter, 2051 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2589 GetRequests, 2259 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5113occurred in iteration=11, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 3438 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3548 ConstructedInterpolants, 0 QuantifiedInterpolants, 10648 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 102842/183898 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 18 specifications checked. All of them hold - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:02:40,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE