./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.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 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:28:08,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:28:08,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:28:08,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:28:08,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:28:09,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:28:09,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:28:09,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:28:09,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:28:09,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:28:09,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:28:09,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:28:09,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:28:09,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:28:09,012 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:28:09,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:28:09,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:28:09,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:28:09,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:28:09,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:28:09,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:28:09,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:28:09,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:28:09,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:28:09,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:28:09,021 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:28:09,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:28:09,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:28:09,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:28:09,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:28:09,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:28:09,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:28:09,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:28:09,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:28:09,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:28:09,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:28:09,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:28:09,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:28:09,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:28:09,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:28:09,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:28:09,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:28:09,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:28:09,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:28:09,027 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 -> 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 [2024-10-14 20:28:09,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:28:09,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:28:09,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:28:09,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:28:09,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:28:09,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.c [2024-10-14 20:28:10,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:28:10,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:28:10,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.c [2024-10-14 20:28:10,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0417a4500/d1aacb7d76af48c2975520d24ec0d762/FLAG7e3700380 [2024-10-14 20:28:10,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0417a4500/d1aacb7d76af48c2975520d24ec0d762 [2024-10-14 20:28:10,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:28:10,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:28:10,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:28:10,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:28:10,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:28:10,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:28:10" (1/1) ... [2024-10-14 20:28:10,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f730066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:10, skipping insertion in model container [2024-10-14 20:28:10,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:28:10" (1/1) ... [2024-10-14 20:28:10,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:28:11,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:28:11,146 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:28:11,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:28:11,201 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:28:11,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11 WrapperNode [2024-10-14 20:28:11,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:28:11,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:28:11,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:28:11,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:28:11,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,250 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-10-14 20:28:11,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:28:11,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:28:11,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:28:11,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:28:11,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:28:11,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:28:11,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:28:11,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:28:11,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:28:11,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (1/1) ... [2024-10-14 20:28:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:28:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:28:11,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:28:11,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:28:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:28:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:28:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:28:11,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:28:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:28:11,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:28:11,461 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:28:11,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:28:12,251 INFO L? ?]: Removed 237 outVars from TransFormulas that were not future-live. [2024-10-14 20:28:12,253 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:28:12,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:28:12,299 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:28:12,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:28:12 BoogieIcfgContainer [2024-10-14 20:28:12,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:28:12,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:28:12,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:28:12,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:28:12,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:28:10" (1/3) ... [2024-10-14 20:28:12,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c011554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:28:12, skipping insertion in model container [2024-10-14 20:28:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:28:11" (2/3) ... [2024-10-14 20:28:12,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c011554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:28:12, skipping insertion in model container [2024-10-14 20:28:12,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:28:12" (3/3) ... [2024-10-14 20:28:12,314 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu.c [2024-10-14 20:28:12,330 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:28:12,331 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-10-14 20:28:12,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:28:12,421 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;@1f42b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:28:12,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-10-14 20:28:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 145 states have (on average 1.9793103448275862) internal successors, (287), 283 states have internal predecessors, (287), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 20:28:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 20:28:12,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:12,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 20:28:12,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:12,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash 367452, now seen corresponding path program 1 times [2024-10-14 20:28:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332866774] [2024-10-14 20:28:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:28:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332866774] [2024-10-14 20:28:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332866774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71442487] [2024-10-14 20:28:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:28:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:28:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:28:12,618 INFO L87 Difference]: Start difference. First operand has 296 states, 145 states have (on average 1.9793103448275862) internal successors, (287), 283 states have internal predecessors, (287), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:28:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:12,679 INFO L93 Difference]: Finished difference Result 584 states and 628 transitions. [2024-10-14 20:28:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:28:12,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 20:28:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:12,691 INFO L225 Difference]: With dead ends: 584 [2024-10-14 20:28:12,691 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 20:28:12,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:28:12,698 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:12,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:28:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 20:28:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-14 20:28:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 144 states have (on average 1.9097222222222223) internal successors, (275), 274 states have internal predecessors, (275), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:28:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 295 transitions. [2024-10-14 20:28:12,770 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 295 transitions. Word has length 3 [2024-10-14 20:28:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:12,770 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 295 transitions. [2024-10-14 20:28:12,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:28:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 295 transitions. [2024-10-14 20:28:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 20:28:12,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:12,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 20:28:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:28:12,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash 363611, now seen corresponding path program 1 times [2024-10-14 20:28:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484182300] [2024-10-14 20:28:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:28:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484182300] [2024-10-14 20:28:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484182300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:28:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110730606] [2024-10-14 20:28:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:12,856 INFO L87 Difference]: Start difference. First operand 286 states and 295 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:28:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:13,049 INFO L93 Difference]: Finished difference Result 555 states and 574 transitions. [2024-10-14 20:28:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 20:28:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:13,055 INFO L225 Difference]: With dead ends: 555 [2024-10-14 20:28:13,056 INFO L226 Difference]: Without dead ends: 535 [2024-10-14 20:28:13,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:13,057 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 237 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:13,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 516 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:28:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-14 20:28:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 345. [2024-10-14 20:28:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 198 states have (on average 1.803030303030303) internal successors, (357), 328 states have internal predecessors, (357), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 20:28:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2024-10-14 20:28:13,090 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 3 [2024-10-14 20:28:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:13,090 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2024-10-14 20:28:13,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:28:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2024-10-14 20:28:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 20:28:13,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:13,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:28:13,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:13,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash -405705968, now seen corresponding path program 1 times [2024-10-14 20:28:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349032419] [2024-10-14 20:28:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:28:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883060891] [2024-10-14 20:28:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:13,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:28:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:28:13,149 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-10-14 20:28:13,150 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-10-14 20:28:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:13,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:28:13,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:28:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:13,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:28:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349032419] [2024-10-14 20:28:13,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:28:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883060891] [2024-10-14 20:28:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883060891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:13,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:13,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626147354] [2024-10-14 20:28:13,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:13,429 INFO L87 Difference]: Start difference. First operand 345 states and 387 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:13,998 INFO L93 Difference]: Finished difference Result 505 states and 562 transitions. [2024-10-14 20:28:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-14 20:28:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:14,001 INFO L225 Difference]: With dead ends: 505 [2024-10-14 20:28:14,001 INFO L226 Difference]: Without dead ends: 450 [2024-10-14 20:28:14,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:14,003 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 134 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:14,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 263 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:28:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-14 20:28:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 430. [2024-10-14 20:28:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.6546762589928057) internal successors, (460), 408 states have internal predecessors, (460), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 500 transitions. [2024-10-14 20:28:14,027 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 500 transitions. Word has length 36 [2024-10-14 20:28:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:14,027 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 500 transitions. [2024-10-14 20:28:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 500 transitions. [2024-10-14 20:28:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 20:28:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:14,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:14,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:28:14,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:28:14,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:14,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash 958591378, now seen corresponding path program 1 times [2024-10-14 20:28:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:14,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833706945] [2024-10-14 20:28:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833706945] [2024-10-14 20:28:14,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833706945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:14,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:14,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746951260] [2024-10-14 20:28:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:14,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:14,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:14,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:14,400 INFO L87 Difference]: Start difference. First operand 430 states and 500 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:14,808 INFO L93 Difference]: Finished difference Result 463 states and 507 transitions. [2024-10-14 20:28:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-10-14 20:28:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:14,811 INFO L225 Difference]: With dead ends: 463 [2024-10-14 20:28:14,814 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 20:28:14,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:14,815 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 120 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:14,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 421 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:28:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 20:28:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-14 20:28:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.5719424460431655) internal successors, (437), 408 states have internal predecessors, (437), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2024-10-14 20:28:14,860 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 38 [2024-10-14 20:28:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:14,861 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2024-10-14 20:28:14,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2024-10-14 20:28:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:28:14,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:14,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:28:14,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:14,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2083315732, now seen corresponding path program 1 times [2024-10-14 20:28:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525725350] [2024-10-14 20:28:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525725350] [2024-10-14 20:28:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525725350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:28:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438943208] [2024-10-14 20:28:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:28:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:14,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:28:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:28:14,979 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:15,570 INFO L93 Difference]: Finished difference Result 442 states and 484 transitions. [2024-10-14 20:28:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:28:15,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-14 20:28:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:15,573 INFO L225 Difference]: With dead ends: 442 [2024-10-14 20:28:15,573 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 20:28:15,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-14 20:28:15,574 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 253 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:15,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 363 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 20:28:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 20:28:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-14 20:28:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.564748201438849) internal successors, (435), 408 states have internal predecessors, (435), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 475 transitions. [2024-10-14 20:28:15,588 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 475 transitions. Word has length 40 [2024-10-14 20:28:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 475 transitions. [2024-10-14 20:28:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 475 transitions. [2024-10-14 20:28:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 20:28:15,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:15,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:15,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:28:15,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 158278344, now seen corresponding path program 1 times [2024-10-14 20:28:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144601587] [2024-10-14 20:28:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:15,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144601587] [2024-10-14 20:28:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144601587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:28:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221675407] [2024-10-14 20:28:15,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:15,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:28:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:28:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:28:15,737 INFO L87 Difference]: Start difference. First operand 430 states and 475 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:18,041 INFO L93 Difference]: Finished difference Result 442 states and 482 transitions. [2024-10-14 20:28:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:28:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-14 20:28:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:18,044 INFO L225 Difference]: With dead ends: 442 [2024-10-14 20:28:18,044 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 20:28:18,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-14 20:28:18,045 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 137 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:18,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 443 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 20:28:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 20:28:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-14 20:28:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.5575539568345325) internal successors, (433), 408 states have internal predecessors, (433), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 473 transitions. [2024-10-14 20:28:18,064 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 473 transitions. Word has length 41 [2024-10-14 20:28:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 473 transitions. [2024-10-14 20:28:18,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 473 transitions. [2024-10-14 20:28:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:28:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:18,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:28:18,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:18,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash -603851496, now seen corresponding path program 1 times [2024-10-14 20:28:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989253772] [2024-10-14 20:28:18,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:28:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902862488] [2024-10-14 20:28:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:28:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:28:18,098 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-10-14 20:28:18,102 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-10-14 20:28:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:18,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:28:18,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:28:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:18,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:28:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989253772] [2024-10-14 20:28:18,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 20:28:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902862488] [2024-10-14 20:28:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902862488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447275963] [2024-10-14 20:28:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:18,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:18,379 INFO L87 Difference]: Start difference. First operand 430 states and 473 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:18,886 INFO L93 Difference]: Finished difference Result 447 states and 480 transitions. [2024-10-14 20:28:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-14 20:28:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:18,889 INFO L225 Difference]: With dead ends: 447 [2024-10-14 20:28:18,889 INFO L226 Difference]: Without dead ends: 438 [2024-10-14 20:28:18,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:18,890 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 112 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:18,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 253 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:28:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-14 20:28:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2024-10-14 20:28:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 281 states have (on average 1.5302491103202847) internal successors, (430), 411 states have internal predecessors, (430), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 470 transitions. [2024-10-14 20:28:18,902 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 470 transitions. Word has length 44 [2024-10-14 20:28:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:18,903 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 470 transitions. [2024-10-14 20:28:18,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 470 transitions. [2024-10-14 20:28:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:28:18,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:18,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:18,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:28:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 20:28:19,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1539527092, now seen corresponding path program 1 times [2024-10-14 20:28:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560155102] [2024-10-14 20:28:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560155102] [2024-10-14 20:28:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560155102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:19,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:19,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:28:19,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075185977] [2024-10-14 20:28:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:19,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:28:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:28:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:28:19,210 INFO L87 Difference]: Start difference. First operand 433 states and 470 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:19,691 INFO L93 Difference]: Finished difference Result 446 states and 471 transitions. [2024-10-14 20:28:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:28:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-14 20:28:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:19,694 INFO L225 Difference]: With dead ends: 446 [2024-10-14 20:28:19,694 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 20:28:19,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-14 20:28:19,695 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 244 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:19,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 301 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:28:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 20:28:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2024-10-14 20:28:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 281 states have (on average 1.508896797153025) internal successors, (424), 411 states have internal predecessors, (424), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 20:28:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 464 transitions. [2024-10-14 20:28:19,708 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 464 transitions. Word has length 45 [2024-10-14 20:28:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:19,709 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 464 transitions. [2024-10-14 20:28:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 464 transitions. [2024-10-14 20:28:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 20:28:19,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:19,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:28:19,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1097557552, now seen corresponding path program 1 times [2024-10-14 20:28:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008452530] [2024-10-14 20:28:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:28:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008452530] [2024-10-14 20:28:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008452530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:28:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315547402] [2024-10-14 20:28:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:19,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:28:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:28:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:28:19,844 INFO L87 Difference]: Start difference. First operand 433 states and 464 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:20,326 INFO L93 Difference]: Finished difference Result 444 states and 465 transitions. [2024-10-14 20:28:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-10-14 20:28:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:20,328 INFO L225 Difference]: With dead ends: 444 [2024-10-14 20:28:20,328 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 20:28:20,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-14 20:28:20,330 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 226 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:20,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 265 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 20:28:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 20:28:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2024-10-14 20:28:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 218 states have (on average 1.628440366972477) internal successors, (355), 348 states have internal predecessors, (355), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 20:28:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 389 transitions. [2024-10-14 20:28:20,340 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 389 transitions. Word has length 49 [2024-10-14 20:28:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:20,340 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 389 transitions. [2024-10-14 20:28:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 20:28:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 389 transitions. [2024-10-14 20:28:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 20:28:20,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:20,342 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:28:20,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:20,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 887204562, now seen corresponding path program 1 times [2024-10-14 20:28:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947779052] [2024-10-14 20:28:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 20:28:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:28:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 20:28:20,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947779052] [2024-10-14 20:28:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947779052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96013487] [2024-10-14 20:28:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:20,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:20,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:20,433 INFO L87 Difference]: Start difference. First operand 367 states and 389 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 20:28:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:20,809 INFO L93 Difference]: Finished difference Result 367 states and 389 transitions. [2024-10-14 20:28:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:20,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 81 [2024-10-14 20:28:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:20,812 INFO L225 Difference]: With dead ends: 367 [2024-10-14 20:28:20,812 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 20:28:20,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:20,813 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 138 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:20,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 150 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:28:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 20:28:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-14 20:28:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 218 states have (on average 1.5963302752293578) internal successors, (348), 341 states have internal predecessors, (348), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 20:28:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 382 transitions. [2024-10-14 20:28:20,823 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 382 transitions. Word has length 81 [2024-10-14 20:28:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 382 transitions. [2024-10-14 20:28:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 20:28:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 382 transitions. [2024-10-14 20:28:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 20:28:20,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:20,825 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:20,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:28:20,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:20,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1733537805, now seen corresponding path program 1 times [2024-10-14 20:28:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881884149] [2024-10-14 20:28:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:28:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:28:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 20:28:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 20:28:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:28:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:28:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 20:28:20,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:28:20,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881884149] [2024-10-14 20:28:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881884149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:28:20,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:28:20,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:28:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037319619] [2024-10-14 20:28:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:28:20,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:28:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:28:20,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:28:20,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:20,894 INFO L87 Difference]: Start difference. First operand 360 states and 382 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 20:28:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:28:21,192 INFO L93 Difference]: Finished difference Result 367 states and 385 transitions. [2024-10-14 20:28:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:28:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 82 [2024-10-14 20:28:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:28:21,194 INFO L225 Difference]: With dead ends: 367 [2024-10-14 20:28:21,194 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 20:28:21,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:28:21,195 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 24 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:28:21,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 388 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:28:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 20:28:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2024-10-14 20:28:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 220 states have (on average 1.5909090909090908) internal successors, (350), 343 states have internal predecessors, (350), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 20:28:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 384 transitions. [2024-10-14 20:28:21,205 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 384 transitions. Word has length 82 [2024-10-14 20:28:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:28:21,206 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 384 transitions. [2024-10-14 20:28:21,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 20:28:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 384 transitions. [2024-10-14 20:28:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 20:28:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:28:21,208 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:21,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:28:21,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-10-14 20:28:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:28:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -307995884, now seen corresponding path program 1 times [2024-10-14 20:28:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:28:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928041919] [2024-10-14 20:28:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:28:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 20:28:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468256981] [2024-10-14 20:28:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:28:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:28:21,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:28:21,227 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-10-14 20:28:21,228 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-10-14 20:28:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:28:21,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 20:28:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 20:28:21,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 20:28:21,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 20:28:21,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-10-14 20:28:21,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-10-14 20:28:21,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-10-14 20:28:21,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-10-14 20:28:21,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-10-14 20:28:21,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-10-14 20:28:21,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-10-14 20:28:21,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-10-14 20:28:21,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-10-14 20:28:21,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-10-14 20:28:21,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-10-14 20:28:21,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-10-14 20:28:21,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-10-14 20:28:21,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-10-14 20:28:21,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-10-14 20:28:21,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-10-14 20:28:21,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-10-14 20:28:21,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-10-14 20:28:21,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-10-14 20:28:21,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-10-14 20:28:21,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-10-14 20:28:21,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-10-14 20:28:21,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-10-14 20:28:21,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-10-14 20:28:21,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-10-14 20:28:21,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-10-14 20:28:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-10-14 20:28:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-10-14 20:28:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-10-14 20:28:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-10-14 20:28:21,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-10-14 20:28:21,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-10-14 20:28:21,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-10-14 20:28:21,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-10-14 20:28:21,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-10-14 20:28:21,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-10-14 20:28:21,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-10-14 20:28:21,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-10-14 20:28:21,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-10-14 20:28:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 20:28:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:28:21,559 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:28:21,601 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:28:21,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:28:21 BoogieIcfgContainer [2024-10-14 20:28:21,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:28:21,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:28:21,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:28:21,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:28:21,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:28:12" (3/4) ... [2024-10-14 20:28:21,609 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 20:28:21,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:28:21,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:28:21,666 INFO L158 Benchmark]: Toolchain (without parser) took 10815.08ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 90.2MB in the beginning and 114.7MB in the end (delta: -24.5MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,666 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:28:21,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.94ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 116.9MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.91ms. Allocated memory is still 148.9MB. Free memory was 116.9MB in the beginning and 114.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,667 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,667 INFO L158 Benchmark]: RCFGBuilder took 998.85ms. Allocated memory is still 148.9MB. Free memory was 112.2MB in the beginning and 72.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,667 INFO L158 Benchmark]: TraceAbstraction took 9302.59ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 71.7MB in the beginning and 117.8MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:28:21,668 INFO L158 Benchmark]: Witness Printer took 57.74ms. Allocated memory is still 182.5MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:28:21,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.94ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 116.9MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.91ms. Allocated memory is still 148.9MB. Free memory was 116.9MB in the beginning and 114.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 998.85ms. Allocated memory is still 148.9MB. Free memory was 112.2MB in the beginning and 72.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9302.59ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 71.7MB in the beginning and 117.8MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 57.74ms. Allocated memory is still 182.5MB. Free memory was 117.8MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int a, n, x, y, z; [L24] a = __VERIFIER_nondet_int() [L25] n = 0 [L26] x = 0 [L27] y = 1 [L28] z = 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L30] COND TRUE 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L31] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n + 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L32] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L33] RET __VERIFIER_assert(x == n * n * n) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z - 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR z*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z + 12 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L36] COND TRUE !(n <= a) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L45] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L46] 6*a VAL [n=0, x=0, y=1, z=6] - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 296 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1700 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1625 mSDsluCounter, 3660 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1451 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2596 IncrementalHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 2209 mSDtfsCounter, 2596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 260 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 164/164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 20:28:21,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)