./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/bh2017-ex1-poly.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 d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:26:21,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:26:21,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:26:21,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:26:21,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:26:21,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:26:21,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:26:21,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:26:21,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:26:21,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:26:21,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:26:21,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:26:21,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:26:21,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:26:21,658 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:26:21,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:26:21,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:26:21,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:26:21,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:26:21,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:26:21,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:26:21,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:26:21,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:26:21,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:26:21,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:26:21,665 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:26:21,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:26:21,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:26:21,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:26:21,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:26:21,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:26:21,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:26:21,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:26:21,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:26:21,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:21,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:26:21,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:26:21,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:26:21,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:26:21,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:26:21,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:26:21,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:26:21,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:26:21,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:26:21,670 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 [2024-11-09 11:26:21,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:26:21,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:26:21,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:26:21,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:26:21,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:26:21,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-09 11:26:23,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:26:23,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:26:23,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-11-09 11:26:23,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bcb5cb8/c4f0dbd7411448929f4bebf658ad07e0/FLAGae6fe27f9 [2024-11-09 11:26:23,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4bcb5cb8/c4f0dbd7411448929f4bebf658ad07e0 [2024-11-09 11:26:23,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:26:23,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:26:23,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:23,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:26:23,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:26:23,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:23,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23, skipping insertion in model container [2024-11-09 11:26:23,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:23,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:26:23,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:23,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:26:23,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:23,985 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:26:23,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23 WrapperNode [2024-11-09 11:26:23,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:23,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:23,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:26:23,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:26:23,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,018 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-09 11:26:24,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:24,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:26:24,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:26:24,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:26:24,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,042 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-09 11:26:24,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:26:24,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:26:24,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:26:24,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:26:24,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (1/1) ... [2024-11-09 11:26:24,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:24,078 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-09 11:26:24,080 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-09 11:26:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:26:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:26:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:26:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:26:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:26:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:26:24,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:26:24,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:26:24,364 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 11:26:24,364 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:26:24,381 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:26:24,381 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:26:24,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:24 BoogieIcfgContainer [2024-11-09 11:26:24,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:26:24,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:26:24,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:26:24,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:26:24,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:26:23" (1/3) ... [2024-11-09 11:26:24,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52caddcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:24, skipping insertion in model container [2024-11-09 11:26:24,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:23" (2/3) ... [2024-11-09 11:26:24,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52caddcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:24, skipping insertion in model container [2024-11-09 11:26:24,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:24" (3/3) ... [2024-11-09 11:26:24,390 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-11-09 11:26:24,406 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:26:24,406 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-09 11:26:24,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:26:24,463 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;@61d3b556, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:26:24,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 11:26:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 35 states have (on average 1.8) internal successors, (63), 58 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:26:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:26:24,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:24,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:26:24,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2024-11-09 11:26:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105242520] [2024-11-09 11:26:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:24,664 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-09 11:26:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:24,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105242520] [2024-11-09 11:26:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105242520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:24,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478641476] [2024-11-09 11:26:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:24,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:24,701 INFO L87 Difference]: Start difference. First operand has 67 states, 35 states have (on average 1.8) internal successors, (63), 58 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:24,846 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2024-11-09 11:26:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 11:26:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:24,855 INFO L225 Difference]: With dead ends: 155 [2024-11-09 11:26:24,855 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 11:26:24,858 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-09 11:26:24,861 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:24,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 155 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 11:26:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2024-11-09 11:26:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 59 states have internal predecessors, (61), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:26:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-11-09 11:26:24,907 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 5 [2024-11-09 11:26:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:24,910 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-11-09 11:26:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:26:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-11-09 11:26:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:26:24,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:24,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:26:24,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2024-11-09 11:26:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402326547] [2024-11-09 11:26:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:24,970 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-09 11:26:24,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402326547] [2024-11-09 11:26:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402326547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:26:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652836329] [2024-11-09 11:26:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:26:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:24,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:26:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:26:24,972 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-09 11:26:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,029 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-11-09 11:26:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:26:25,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-09 11:26:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,031 INFO L225 Difference]: With dead ends: 135 [2024-11-09 11:26:25,033 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 11:26:25,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:26:25,034 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 11:26:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-09 11:26:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 59 states have internal predecessors, (63), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:26:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-09 11:26:25,047 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 7 [2024-11-09 11:26:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,048 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-09 11:26:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-09 11:26:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-11-09 11:26:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:26:25,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:26:25,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash 395086042, now seen corresponding path program 1 times [2024-11-09 11:26:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758074383] [2024-11-09 11:26:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,128 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-09 11:26:25,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758074383] [2024-11-09 11:26:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758074383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:26:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068955035] [2024-11-09 11:26:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:26:25,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:26:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:25,132 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 11:26:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,266 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-09 11:26:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:26:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2024-11-09 11:26:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,268 INFO L225 Difference]: With dead ends: 108 [2024-11-09 11:26:25,268 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 11:26:25,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:25,271 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 11:26:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2024-11-09 11:26:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.62) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:26:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2024-11-09 11:26:25,291 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 14 [2024-11-09 11:26:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,292 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2024-11-09 11:26:25,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-09 11:26:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2024-11-09 11:26:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:26:25,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:26:25,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -637234523, now seen corresponding path program 1 times [2024-11-09 11:26:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955983937] [2024-11-09 11:26:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,394 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-09 11:26:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955983937] [2024-11-09 11:26:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955983937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:26:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366225417] [2024-11-09 11:26:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:26:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:26:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:25,399 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-09 11:26:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,512 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2024-11-09 11:26:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:26:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-09 11:26:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,513 INFO L225 Difference]: With dead ends: 108 [2024-11-09 11:26:25,513 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 11:26:25,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:26:25,515 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 163 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 11:26:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2024-11-09 11:26:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 72 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:26:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-11-09 11:26:25,523 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 15 [2024-11-09 11:26:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,524 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-11-09 11:26:25,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-09 11:26:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-11-09 11:26:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:26:25,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:26:25,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash -147313453, now seen corresponding path program 1 times [2024-11-09 11:26:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226513876] [2024-11-09 11:26:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:26:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226513876] [2024-11-09 11:26:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226513876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:25,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978458409] [2024-11-09 11:26:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:25,593 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-09 11:26:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,659 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2024-11-09 11:26:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 23 [2024-11-09 11:26:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,661 INFO L225 Difference]: With dead ends: 90 [2024-11-09 11:26:25,661 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 11:26:25,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 11:26:25,662 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 94 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 11:26:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-09 11:26:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:26:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2024-11-09 11:26:25,670 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 23 [2024-11-09 11:26:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2024-11-09 11:26:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-09 11:26:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2024-11-09 11:26:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:26:25,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:26:25,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash -271749675, now seen corresponding path program 1 times [2024-11-09 11:26:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382422140] [2024-11-09 11:26:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:26:25,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382422140] [2024-11-09 11:26:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382422140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269250704] [2024-11-09 11:26:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:25,717 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-09 11:26:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,764 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2024-11-09 11:26:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-11-09 11:26:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,765 INFO L225 Difference]: With dead ends: 159 [2024-11-09 11:26:25,765 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 11:26:25,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:25,767 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 11:26:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2024-11-09 11:26:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 67 states have internal predecessors, (75), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:26:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2024-11-09 11:26:25,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 24 [2024-11-09 11:26:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2024-11-09 11:26:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-09 11:26:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2024-11-09 11:26:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:26:25,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:26:25,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 839709403, now seen corresponding path program 1 times [2024-11-09 11:26:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960470553] [2024-11-09 11:26:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960470553] [2024-11-09 11:26:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960470553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230235355] [2024-11-09 11:26:25,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:25,823 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:26:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:25,872 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2024-11-09 11:26:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:25,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-09 11:26:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:25,873 INFO L225 Difference]: With dead ends: 85 [2024-11-09 11:26:25,873 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 11:26:25,874 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-09 11:26:25,874 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:25,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 84 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 11:26:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 11:26:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:26:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2024-11-09 11:26:25,888 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 36 [2024-11-09 11:26:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:25,888 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2024-11-09 11:26:25,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:26:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2024-11-09 11:26:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 11:26:25,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:25,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:26:25,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 261187771, now seen corresponding path program 1 times [2024-11-09 11:26:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876656969] [2024-11-09 11:26:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:26:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876656969] [2024-11-09 11:26:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876656969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:25,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629722774] [2024-11-09 11:26:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:25,965 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:26:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:26,006 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2024-11-09 11:26:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-09 11:26:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:26,007 INFO L225 Difference]: With dead ends: 80 [2024-11-09 11:26:26,007 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 11:26:26,007 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-09 11:26:26,008 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:26,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 11:26:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-09 11:26:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 11:26:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-11-09 11:26:26,021 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 37 [2024-11-09 11:26:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-09 11:26:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:26:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2024-11-09 11:26:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:26:26,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:26,022 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:26,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:26:26,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -937582121, now seen corresponding path program 1 times [2024-11-09 11:26:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399997084] [2024-11-09 11:26:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:26:26,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399997084] [2024-11-09 11:26:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399997084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294060244] [2024-11-09 11:26:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:26,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:26,111 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-09 11:26:26,112 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-09 11:26:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:26:26,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:26:26,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:26:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294060244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:26,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 11:26:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204013198] [2024-11-09 11:26:26,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:26,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:26:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:26:26,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:26:26,329 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:26:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:26,563 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2024-11-09 11:26:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:26:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2024-11-09 11:26:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:26,565 INFO L225 Difference]: With dead ends: 157 [2024-11-09 11:26:26,565 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 11:26:26,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:26:26,566 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 85 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:26,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 212 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 11:26:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2024-11-09 11:26:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 91 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 11:26:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2024-11-09 11:26:26,584 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 46 [2024-11-09 11:26:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:26,585 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2024-11-09 11:26:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:26:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2024-11-09 11:26:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:26:26,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:26,588 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:26,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:26:26,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:26,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:26,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash -775072029, now seen corresponding path program 1 times [2024-11-09 11:26:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691972767] [2024-11-09 11:26:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:26:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 11:26:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691972767] [2024-11-09 11:26:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691972767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388685273] [2024-11-09 11:26:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:26,835 INFO L87 Difference]: Start difference. First operand 118 states and 147 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:26:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:26,879 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2024-11-09 11:26:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:26,880 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-11-09 11:26:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:26,881 INFO L225 Difference]: With dead ends: 118 [2024-11-09 11:26:26,881 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 11:26:26,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:26,881 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:26,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 11:26:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 11:26:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 88 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 11:26:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2024-11-09 11:26:26,892 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 55 [2024-11-09 11:26:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2024-11-09 11:26:26,892 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:26:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2024-11-09 11:26:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:26:26,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:26,898 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:26,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:26:26,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:26,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -725368722, now seen corresponding path program 1 times [2024-11-09 11:26:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632292121] [2024-11-09 11:26:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:26:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:26:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:26:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:26:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:26:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:26:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:26:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:26:27,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632292121] [2024-11-09 11:26:27,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632292121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491193885] [2024-11-09 11:26:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:27,175 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-09 11:26:27,176 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-09 11:26:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:27,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:26:27,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:26:27,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:26:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491193885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:28,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:28,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2024-11-09 11:26:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128816166] [2024-11-09 11:26:28,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:28,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 11:26:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 11:26:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-11-09 11:26:28,011 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 11:26:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:28,335 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2024-11-09 11:26:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:26:28,336 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 95 [2024-11-09 11:26:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:28,337 INFO L225 Difference]: With dead ends: 115 [2024-11-09 11:26:28,337 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 11:26:28,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:26:28,338 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:28,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 213 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:26:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 11:26:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 11:26:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 11:26:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2024-11-09 11:26:28,345 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 95 [2024-11-09 11:26:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:28,346 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2024-11-09 11:26:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 11:26:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2024-11-09 11:26:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 11:26:28,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:28,347 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:28,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:26:28,551 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,SelfDestructingSolverStorable10 [2024-11-09 11:26:28,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1011593801, now seen corresponding path program 1 times [2024-11-09 11:26:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:28,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491213042] [2024-11-09 11:26:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:26:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:26:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:26:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:26:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:26:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:26:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:26:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-09 11:26:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491213042] [2024-11-09 11:26:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491213042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711873007] [2024-11-09 11:26:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:28,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:28,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:28,736 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-09 11:26:28,738 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-09 11:26:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:28,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:26:28,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:26:28,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:26:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711873007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:29,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:29,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 25 [2024-11-09 11:26:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34749946] [2024-11-09 11:26:29,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 11:26:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:29,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 11:26:29,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:26:29,390 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 26 states, 25 states have (on average 4.12) internal successors, (103), 26 states have internal predecessors, (103), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-09 11:26:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:29,721 INFO L93 Difference]: Finished difference Result 189 states and 236 transitions. [2024-11-09 11:26:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:26:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 26 states have internal predecessors, (103), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 96 [2024-11-09 11:26:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:29,723 INFO L225 Difference]: With dead ends: 189 [2024-11-09 11:26:29,723 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 11:26:29,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:26:29,724 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:29,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 11:26:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-09 11:26:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 states have internal predecessors, (86), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 11:26:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-11-09 11:26:29,732 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 96 [2024-11-09 11:26:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-11-09 11:26:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 26 states have internal predecessors, (103), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-09 11:26:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2024-11-09 11:26:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 11:26:29,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:29,735 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:29,749 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-09 11:26:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:29,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:29,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1646830866, now seen corresponding path program 1 times [2024-11-09 11:26:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320783290] [2024-11-09 11:26:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:26:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:26:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:26:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:26:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:26:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:26:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:26:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:26:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 11:26:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:26:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:26:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 11:26:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:26:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:26:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 11:26:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-09 11:26:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 104 proven. 6 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-09 11:26:30,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:30,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320783290] [2024-11-09 11:26:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320783290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553372316] [2024-11-09 11:26:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:30,088 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-09 11:26:30,089 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-09 11:26:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:26:30,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-09 11:26:30,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:26:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553372316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:26:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-09 11:26:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418500535] [2024-11-09 11:26:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:26:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:26:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:26:30,210 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 11:26:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:30,244 INFO L93 Difference]: Finished difference Result 164 states and 201 transitions. [2024-11-09 11:26:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:26:30,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 173 [2024-11-09 11:26:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:30,246 INFO L225 Difference]: With dead ends: 164 [2024-11-09 11:26:30,246 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 11:26:30,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:26:30,247 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:30,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 11:26:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-09 11:26:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:26:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2024-11-09 11:26:30,257 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 173 [2024-11-09 11:26:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:30,257 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2024-11-09 11:26:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-09 11:26:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2024-11-09 11:26:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-09 11:26:30,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:30,259 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 11:26:30,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:26:30,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:30,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:26:30,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1076443632, now seen corresponding path program 1 times [2024-11-09 11:26:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:30,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441936338] [2024-11-09 11:26:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:26:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:26:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 11:26:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:26:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:26:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:26:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:26:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:26:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:26:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:26:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:26:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:26:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 11:26:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:26:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:26:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 11:26:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:26:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 11:26:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 11:26:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-09 11:26:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-09 11:26:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-09 11:26:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 11:26:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2024-11-09 11:26:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441936338] [2024-11-09 11:26:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441936338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467216984] [2024-11-09 11:26:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:30,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:30,896 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-09 11:26:30,897 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-09 11:26:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:30,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 11:26:30,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 11:26:31,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 11:26:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467216984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:32,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 45 [2024-11-09 11:26:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109872193] [2024-11-09 11:26:32,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:32,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 11:26:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 11:26:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=1554, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 11:26:32,318 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 46 states, 45 states have (on average 4.822222222222222) internal successors, (217), 46 states have internal predecessors, (217), 14 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 14 states have call predecessors, (68), 14 states have call successors, (68) [2024-11-09 11:26:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:32,886 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2024-11-09 11:26:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 11:26:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.822222222222222) internal successors, (217), 46 states have internal predecessors, (217), 14 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 14 states have call predecessors, (68), 14 states have call successors, (68) Word has length 194 [2024-11-09 11:26:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:32,887 INFO L225 Difference]: With dead ends: 168 [2024-11-09 11:26:32,887 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:26:32,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 11:26:32,889 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:32,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 169 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:26:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:26:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:26:32,889 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-09 11:26:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:26:32,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2024-11-09 11:26:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:26:32,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.822222222222222) internal successors, (217), 46 states have internal predecessors, (217), 14 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 14 states have call predecessors, (68), 14 states have call successors, (68) [2024-11-09 11:26:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:26:32,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-09 11:26:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-09 11:26:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-09 11:26:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-09 11:26:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-09 11:26:32,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:26:33,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 11:26:33,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:33,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:26:33,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:26:33,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:26:33 BoogieIcfgContainer [2024-11-09 11:26:33,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:26:33,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:26:33,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:26:33,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:26:33,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:24" (3/4) ... [2024-11-09 11:26:33,393 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:26:33,396 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:26:33,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 11:26:33,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:26:33,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:26:33,400 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:26:33,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:26:33,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:26:33,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:26:33,485 INFO L158 Benchmark]: Toolchain (without parser) took 9731.04ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 133.8MB in the beginning and 206.3MB in the end (delta: -72.5MB). Peak memory consumption was 145.5MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,485 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:33,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.39ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 121.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 165.7MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,486 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 118.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,486 INFO L158 Benchmark]: RCFGBuilder took 331.79ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 126.0MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,486 INFO L158 Benchmark]: TraceAbstraction took 9005.22ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 124.8MB in the beginning and 70.1MB in the end (delta: 54.6MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,486 INFO L158 Benchmark]: Witness Printer took 93.75ms. Allocated memory is still 243.3MB. Free memory was 70.1MB in the beginning and 206.3MB in the end (delta: -136.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-09 11:26:33,487 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.14ms. Allocated memory is still 165.7MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.39ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 121.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 165.7MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 118.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.79ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 126.0MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9005.22ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 124.8MB in the beginning and 70.1MB in the end (delta: 54.6MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. * Witness Printer took 93.75ms. Allocated memory is still 243.3MB. Free memory was 70.1MB in the beginning and 206.3MB in the end (delta: -136.1MB). Peak memory consumption was 3.4MB. 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: 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 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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: 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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 67 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 14, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 1870 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1261 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2612 IncrementalHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 609 mSDtfsCounter, 2612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1305 GetRequests, 1159 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1923 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 104 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 7394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 7102/7560 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 22 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i == 0) || ((1 <= i) && (i <= 2147483646))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((2 == j) && (i == 1)) || (((2 == j) && (2 <= i)) && (i <= 1073741822))) || ((i == 0) && (j == 0))) || (((1 <= i) && (i <= 3)) && (j == 0))) || (((j == 4) && (2 <= i)) && (i <= 1073741823))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:26:33,509 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