./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i -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 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:52:54,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:52:54,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:52:54,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:52:54,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:52:54,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:52:54,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:52:54,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:52:54,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:52:54,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:52:54,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:52:54,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:52:54,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:52:54,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:52:54,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:52:54,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:52:54,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:52:54,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:52:54,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:52:54,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:52:54,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:52:54,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:52:54,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:52:54,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:52:54,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:52:54,506 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:52:54,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:52:54,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:52:54,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:52:54,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:52:54,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:52:54,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:52:54,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:52:54,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:52:54,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:54,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:52:54,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:52:54,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:52:54,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:52:54,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:52:54,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:52:54,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:52:54,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:52:54,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:52:54,511 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 -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 [2024-11-10 18:52:54,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:52:54,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:52:54,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:52:54,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:52:54,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:52:54,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-11-10 18:52:56,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:52:56,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:52:56,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-11-10 18:52:56,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd2b443ee/5049a57144fe4dde93c2eb4888222997/FLAG2e76a9a4f [2024-11-10 18:52:56,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd2b443ee/5049a57144fe4dde93c2eb4888222997 [2024-11-10 18:52:56,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:52:56,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:52:56,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:56,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:52:56,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:52:56,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:56,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722a2b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56, skipping insertion in model container [2024-11-10 18:52:56,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:56,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:52:56,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:56,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:52:56,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:56,989 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:52:56,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56 WrapperNode [2024-11-10 18:52:56,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:56,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:56,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:52:56,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:52:56,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,012 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-10 18:52:57,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:57,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:52:57,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:52:57,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:52:57,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,029 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-11-10 18:52:57,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:52:57,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:52:57,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:52:57,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:52:57,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (1/1) ... [2024-11-10 18:52:57,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:57,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:57,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:52:57,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:52:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:52:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:52:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:52:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:52:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:52:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:52:57,150 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:52:57,152 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:52:57,228 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 18:52:57,228 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:52:57,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:52:57,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:52:57,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:57 BoogieIcfgContainer [2024-11-10 18:52:57,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:52:57,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:52:57,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:52:57,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:52:57,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:52:56" (1/3) ... [2024-11-10 18:52:57,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214d435f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:57, skipping insertion in model container [2024-11-10 18:52:57,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:56" (2/3) ... [2024-11-10 18:52:57,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214d435f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:57, skipping insertion in model container [2024-11-10 18:52:57,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:57" (3/3) ... [2024-11-10 18:52:57,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex1b.i [2024-11-10 18:52:57,314 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:52:57,314 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 18:52:57,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:52:57,371 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;@28a5cc83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:52:57,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:52:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 18:52:57,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:57,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:57,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:57,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 993299796, now seen corresponding path program 1 times [2024-11-10 18:52:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:57,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738067744] [2024-11-10 18:52:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738067744] [2024-11-10 18:52:57,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738067744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:57,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:57,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527035585] [2024-11-10 18:52:57,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:57,675 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:57,723 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2024-11-10 18:52:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 18:52:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:57,729 INFO L225 Difference]: With dead ends: 68 [2024-11-10 18:52:57,730 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 18:52:57,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:57,735 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:57,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 18:52:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-10 18:52:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:52:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-10 18:52:57,763 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 7 [2024-11-10 18:52:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-10 18:52:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-10 18:52:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:52:57,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:57,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:52:57,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1978729358, now seen corresponding path program 1 times [2024-11-10 18:52:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872813209] [2024-11-10 18:52:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:52:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872813209] [2024-11-10 18:52:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872813209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219132829] [2024-11-10 18:52:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:57,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:57,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:57,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:52:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:57,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:57,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:57,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:52:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219132829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:52:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:52:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662960373] [2024-11-10 18:52:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:52:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:52:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:57,993 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:58,035 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-10 18:52:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:52:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-10 18:52:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:58,037 INFO L225 Difference]: With dead ends: 30 [2024-11-10 18:52:58,037 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 18:52:58,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:58,038 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:58,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 18:52:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-10 18:52:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:52:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-10 18:52:58,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2024-11-10 18:52:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:58,048 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-10 18:52:58,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-10 18:52:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:52:58,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:58,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:58,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:52:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:58,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1211067939, now seen corresponding path program 1 times [2024-11-10 18:52:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357490397] [2024-11-10 18:52:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:52:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:52:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357490397] [2024-11-10 18:52:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357490397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125437282] [2024-11-10 18:52:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:58,316 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:58,322 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-10 18:52:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:52:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:58,323 INFO L225 Difference]: With dead ends: 28 [2024-11-10 18:52:58,323 INFO L226 Difference]: Without dead ends: 27 [2024-11-10 18:52:58,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:58,324 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:58,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-10 18:52:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-10 18:52:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:52:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-10 18:52:58,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2024-11-10 18:52:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 18:52:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:52:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-10 18:52:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:52:58,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:58,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:52:58,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:58,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash -948009744, now seen corresponding path program 1 times [2024-11-10 18:52:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019066843] [2024-11-10 18:52:58,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:52:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:52:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019066843] [2024-11-10 18:52:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019066843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919502993] [2024-11-10 18:52:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:58,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:58,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:52:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:52:58,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:52:58,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919502993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:58,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 18:52:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913958980] [2024-11-10 18:52:58,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:58,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:52:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:52:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:52:58,529 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 18:52:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:58,561 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-11-10 18:52:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:52:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-10 18:52:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:58,562 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:52:58,562 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 18:52:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:52:58,563 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:58,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 18:52:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 18:52:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 18:52:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-10 18:52:58,572 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2024-11-10 18:52:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:58,572 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-10 18:52:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 18:52:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-10 18:52:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:52:58,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:58,573 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:58,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:58,777 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,SelfDestructingSolverStorable3 [2024-11-10 18:52:58,778 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:58,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -19003164, now seen corresponding path program 2 times [2024-11-10 18:52:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803160713] [2024-11-10 18:52:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:52:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:52:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 18:52:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-10 18:52:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803160713] [2024-11-10 18:52:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803160713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417345263] [2024-11-10 18:52:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:58,862 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:58,908 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-11-10 18:52:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:58,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-10 18:52:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:58,909 INFO L225 Difference]: With dead ends: 66 [2024-11-10 18:52:58,909 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 18:52:58,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:58,910 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:58,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 18:52:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-11-10 18:52:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 18:52:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-10 18:52:58,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 43 [2024-11-10 18:52:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-10 18:52:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-10 18:52:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 18:52:58,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:58,920 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:52:58,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -912055891, now seen corresponding path program 1 times [2024-11-10 18:52:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719795085] [2024-11-10 18:52:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:52:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:52:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 18:52:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:52:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 18:52:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:52:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 18:52:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 70 proven. 24 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-10 18:52:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719795085] [2024-11-10 18:52:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719795085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360444922] [2024-11-10 18:52:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:59,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:52:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:52:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:59,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:52:59,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 142 proven. 24 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-10 18:52:59,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 70 proven. 24 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-10 18:52:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360444922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:59,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-10 18:52:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740431564] [2024-11-10 18:52:59,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:59,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 18:52:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 18:52:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:52:59,483 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-10 18:52:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:59,623 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2024-11-10 18:52:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:52:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 92 [2024-11-10 18:52:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:59,630 INFO L225 Difference]: With dead ends: 150 [2024-11-10 18:52:59,630 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 18:52:59,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:52:59,631 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:59,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 18:52:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 18:52:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.043956043956044) internal successors, (95), 92 states have internal predecessors, (95), 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-11-10 18:52:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-10 18:52:59,667 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 92 [2024-11-10 18:52:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-10 18:52:59,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-10 18:52:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-10 18:52:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 18:52:59,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:59,671 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:59,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:52:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:59,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:52:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:59,873 INFO L85 PathProgramCache]: Analyzing trace with hash -360801875, now seen corresponding path program 2 times [2024-11-10 18:52:59,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728166100] [2024-11-10 18:52:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:53:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:53:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:53:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 18:53:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 18:53:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 18:53:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 18:53:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 18:53:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 18:53:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 18:53:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 18:53:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 18:53:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 18:53:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 18:53:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-10 18:53:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 18:53:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 18:53:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 326 proven. 140 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-10 18:53:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728166100] [2024-11-10 18:53:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728166100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:53:00,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150801110] [2024-11-10 18:53:00,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:53:00,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:53:00,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:53:00,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:53:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:53:00,502 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:53:00,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:53:00,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 18:53:00,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:53:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 606 proven. 140 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2024-11-10 18:53:00,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:53:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1153 backedges. 326 proven. 140 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2024-11-10 18:53:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150801110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:53:00,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:53:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-10 18:53:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280985257] [2024-11-10 18:53:00,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:53:00,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 18:53:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 18:53:00,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 18:53:00,935 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-10 18:53:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:01,056 INFO L93 Difference]: Finished difference Result 270 states and 330 transitions. [2024-11-10 18:53:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 18:53:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) Word has length 172 [2024-11-10 18:53:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:01,060 INFO L225 Difference]: With dead ends: 270 [2024-11-10 18:53:01,060 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 18:53:01,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 18:53:01,063 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:01,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:53:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 18:53:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-10 18:53:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 171 states have (on average 1.023391812865497) internal successors, (175), 172 states have internal predecessors, (175), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 18:53:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2024-11-10 18:53:01,088 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 172 [2024-11-10 18:53:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:01,089 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2024-11-10 18:53:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 15 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-10 18:53:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2024-11-10 18:53:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-10 18:53:01,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:01,093 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 32, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:53:01,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:53:01,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:53:01,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:53:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1203521107, now seen corresponding path program 3 times [2024-11-10 18:53:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606276242] [2024-11-10 18:53:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:53:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:53:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:53:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 18:53:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 18:53:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 18:53:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 18:53:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 18:53:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 18:53:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:53:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 18:53:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 18:53:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 18:53:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:53:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 18:53:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 18:53:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 18:53:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 18:53:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 18:53:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-10 18:53:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-10 18:53:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-10 18:53:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 18:53:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-10 18:53:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-10 18:53:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 18:53:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-10 18:53:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-10 18:53:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-11-10 18:53:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-10 18:53:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-10 18:53:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-10 18:53:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-11-10 18:53:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4849 backedges. 1414 proven. 660 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2024-11-10 18:53:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606276242] [2024-11-10 18:53:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606276242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:53:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134929645] [2024-11-10 18:53:02,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:53:02,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:53:02,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:53:02,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:53:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:53:02,606 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-10 18:53:02,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:53:02,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:53:02,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:53:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4849 backedges. 1417 proven. 0 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2024-11-10 18:53:02,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:53:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134929645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:53:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-10 18:53:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144389033] [2024-11-10 18:53:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:02,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:53:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:53:02,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 18:53:02,796 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:53:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:02,814 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2024-11-10 18:53:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:53:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 332 [2024-11-10 18:53:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:02,816 INFO L225 Difference]: With dead ends: 207 [2024-11-10 18:53:02,816 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 18:53:02,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 18:53:02,818 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:02,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:53:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 18:53:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-10 18:53:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 171 states have (on average 1.0175438596491229) internal successors, (174), 171 states have internal predecessors, (174), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 18:53:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 240 transitions. [2024-11-10 18:53:02,831 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 240 transitions. Word has length 332 [2024-11-10 18:53:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:02,831 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 240 transitions. [2024-11-10 18:53:02,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:53:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 240 transitions. [2024-11-10 18:53:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-10 18:53:02,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:02,835 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 32, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:53:02,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:53:03,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:53:03,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:53:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1345551324, now seen corresponding path program 1 times [2024-11-10 18:53:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629281867] [2024-11-10 18:53:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:53:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:53:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:53:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 18:53:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 18:53:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 18:53:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 18:53:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 18:53:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 18:53:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:53:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 18:53:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 18:53:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 18:53:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:53:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 18:53:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 18:53:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 18:53:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 18:53:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 18:53:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-10 18:53:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-10 18:53:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-10 18:53:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 18:53:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-10 18:53:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-10 18:53:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 18:53:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-10 18:53:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-10 18:53:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-11-10 18:53:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-10 18:53:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-10 18:53:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-10 18:53:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-11-10 18:53:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4850 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2024-11-10 18:53:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629281867] [2024-11-10 18:53:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629281867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:03,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:03,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:53:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451748411] [2024-11-10 18:53:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:53:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:53:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:53:03,191 INFO L87 Difference]: Start difference. First operand 206 states and 240 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:53:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:03,205 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2024-11-10 18:53:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:53:03,206 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 333 [2024-11-10 18:53:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:03,206 INFO L225 Difference]: With dead ends: 206 [2024-11-10 18:53:03,206 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:53:03,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:53:03,208 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:03,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:53:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:53:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:53:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:53:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:53:03,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2024-11-10 18:53:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:03,209 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:53:03,209 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), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:53:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:53:03,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:53:03,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 18:53:03,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 18:53:03,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 18:53:03,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 18:53:03,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:53:03,214 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-11-10 18:53:03,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:53:03,525 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:53:03,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:53:03 BoogieIcfgContainer [2024-11-10 18:53:03,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:53:03,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:53:03,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:53:03,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:53:03,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:57" (3/4) ... [2024-11-10 18:53:03,544 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:53:03,548 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 18:53:03,551 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-10 18:53:03,553 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:53:03,553 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:53:03,553 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:53:03,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:53:03,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:53:03,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:53:03,610 INFO L158 Benchmark]: Toolchain (without parser) took 6834.40ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 131.8MB in the beginning and 147.7MB in the end (delta: -15.9MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,610 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 203.4MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:53:03,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.75ms. Allocated memory is still 203.4MB. Free memory was 131.6MB in the beginning and 119.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.28ms. Allocated memory is still 203.4MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,611 INFO L158 Benchmark]: Boogie Preprocessor took 29.32ms. Allocated memory is still 203.4MB. Free memory was 118.1MB in the beginning and 116.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,611 INFO L158 Benchmark]: IcfgBuilder took 195.13ms. Allocated memory is still 203.4MB. Free memory was 116.6MB in the beginning and 105.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,611 INFO L158 Benchmark]: TraceAbstraction took 6301.93ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 105.1MB in the beginning and 152.9MB in the end (delta: -47.8MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,612 INFO L158 Benchmark]: Witness Printer took 68.15ms. Allocated memory is still 310.4MB. Free memory was 152.9MB in the beginning and 147.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:53:03,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 203.4MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.75ms. Allocated memory is still 203.4MB. Free memory was 131.6MB in the beginning and 119.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.28ms. Allocated memory is still 203.4MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.32ms. Allocated memory is still 203.4MB. Free memory was 118.1MB in the beginning and 116.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 195.13ms. Allocated memory is still 203.4MB. Free memory was 116.6MB in the beginning and 105.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6301.93ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 105.1MB in the beginning and 152.9MB in the end (delta: -47.8MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 68.15ms. Allocated memory is still 310.4MB. Free memory was 152.9MB in the beginning and 147.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 900 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 698 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 202 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1195 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1673 NumberOfCodeBlocks, 1403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1943 ConstructedInterpolants, 0 QuantifiedInterpolants, 3251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 17717/18878 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 16]: Location Invariant Derived location invariant: null - InvariantResult [Line: 18]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:53:03,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE