./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 079768eb2ce141267a1411f9330cb4d0cef674bf78865555f3130b47379d643a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:11:50,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:11:50,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:11:50,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:11:50,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:11:50,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:11:50,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:11:50,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:11:50,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:11:50,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:11:50,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:11:50,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:11:50,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:11:50,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:11:50,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:11:50,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:11:50,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:11:50,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:11:50,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:11:50,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:11:50,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:11:50,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:11:50,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:11:50,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:11:50,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:11:50,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:11:50,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:11:50,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:11:50,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:11:50,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:11:50,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:11:50,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:11:50,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:11:50,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:11:50,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:11:50,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:11:50,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:11:50,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:11:50,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:11:50,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:11:50,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:11:50,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:11:50,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:11:50,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:11:50,937 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 -> 079768eb2ce141267a1411f9330cb4d0cef674bf78865555f3130b47379d643a [2024-11-12 17:11:51,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:11:51,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:11:51,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:11:51,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:11:51,235 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:11:51,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-11-12 17:11:52,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:11:52,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:11:52,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-11-12 17:11:52,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c932faf/ec97db86530749b48077e6a23d3c3357/FLAG5ad3bf6cd [2024-11-12 17:11:53,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c932faf/ec97db86530749b48077e6a23d3c3357 [2024-11-12 17:11:53,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:11:53,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:11:53,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:11:53,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:11:53,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:11:53,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c27956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53, skipping insertion in model container [2024-11-12 17:11:53,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:11:53,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:11:53,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:11:53,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:11:53,488 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:11:53,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53 WrapperNode [2024-11-12 17:11:53,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:11:53,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:11:53,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:11:53,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:11:53,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,519 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2024-11-12 17:11:53,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:11:53,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:11:53,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:11:53,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:11:53,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,542 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-12 17:11:53,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:11:53,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:11:53,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:11:53,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:11:53,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2024-11-12 17:11:53,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:11:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:53,583 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-12 17:11:53,585 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-12 17:11:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:11:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:11:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:11:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:11:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:11:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:11:53,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:11:53,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:11:54,074 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-12 17:11:54,074 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:11:54,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:11:54,089 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:11:54,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:54 BoogieIcfgContainer [2024-11-12 17:11:54,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:11:54,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:11:54,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:11:54,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:11:54,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:11:53" (1/3) ... [2024-11-12 17:11:54,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b103a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:54, skipping insertion in model container [2024-11-12 17:11:54,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (2/3) ... [2024-11-12 17:11:54,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b103a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:54, skipping insertion in model container [2024-11-12 17:11:54,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:54" (3/3) ... [2024-11-12 17:11:54,098 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2024-11-12 17:11:54,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:11:54,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-12 17:11:54,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:11:54,185 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;@30b5ec45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:11:54,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-11-12 17:11:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 17:11:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:11:54,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:54,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:11:54,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:54,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-12 17:11:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:54,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280514875] [2024-11-12 17:11:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:54,334 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-12 17:11:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280514875] [2024-11-12 17:11:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280514875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034326522] [2024-11-12 17:11:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 17:11:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 17:11:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:11:54,372 INFO L87 Difference]: Start difference. First operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:54,396 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2024-11-12 17:11:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 17:11:54,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 17:11:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:54,403 INFO L225 Difference]: With dead ends: 186 [2024-11-12 17:11:54,403 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 17:11:54,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 17:11:54,409 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:54,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 17:11:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-12 17:11:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:11:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-12 17:11:54,443 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 6 [2024-11-12 17:11:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:54,444 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-12 17:11:54,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-12 17:11:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:11:54,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:54,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:11:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:11:54,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-12 17:11:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375742009] [2024-11-12 17:11:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:54,566 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-12 17:11:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375742009] [2024-11-12 17:11:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375742009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091276965] [2024-11-12 17:11:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:11:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:11:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:11:54,571 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:54,634 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2024-11-12 17:11:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:11:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 17:11:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:54,636 INFO L225 Difference]: With dead ends: 126 [2024-11-12 17:11:54,637 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 17:11:54,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:54,638 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:54,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 17:11:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-11-12 17:11:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.75) internal successors, (105), 94 states have internal predecessors, (105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:11:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2024-11-12 17:11:54,657 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 6 [2024-11-12 17:11:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2024-11-12 17:11:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2024-11-12 17:11:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 17:11:54,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:54,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:11:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:11:54,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-12 17:11:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591962656] [2024-11-12 17:11:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:54,750 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-12 17:11:54,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:54,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591962656] [2024-11-12 17:11:54,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591962656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:54,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:54,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589695888] [2024-11-12 17:11:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:54,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:11:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:54,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:11:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:11:54,752 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-12 17:11:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:54,852 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2024-11-12 17:11:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:11:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-12 17:11:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:54,855 INFO L225 Difference]: With dead ends: 113 [2024-11-12 17:11:54,856 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 17:11:54,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:54,858 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:54,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 267 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 17:11:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 17:11:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 94 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:11:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-11-12 17:11:54,877 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 7 [2024-11-12 17:11:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:54,878 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-11-12 17:11:54,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-12 17:11:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-11-12 17:11:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 17:11:54,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:54,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:11:54,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:11:54,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:54,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1182784684, now seen corresponding path program 1 times [2024-11-12 17:11:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626121543] [2024-11-12 17:11:54,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102383646] [2024-11-12 17:11:54,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:54,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:54,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:54,909 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-12 17:11:54,910 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-12 17:11:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:54,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:11:54,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:54,990 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-12 17:11:54,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:11:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626121543] [2024-11-12 17:11:54,991 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102383646] [2024-11-12 17:11:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102383646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006053344] [2024-11-12 17:11:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:54,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:11:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:11:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:11:54,994 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:55,083 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-11-12 17:11:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:11:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 17:11:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:55,084 INFO L225 Difference]: With dead ends: 119 [2024-11-12 17:11:55,084 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 17:11:55,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-12 17:11:55,086 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:55,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 17:11:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2024-11-12 17:11:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 94 states have internal predecessors, (101), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 17:11:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-11-12 17:11:55,099 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 9 [2024-11-12 17:11:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:55,099 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-11-12 17:11:55,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:11:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-12 17:11:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 17:11:55,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:55,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:11:55,114 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-12 17:11:55,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:55,302 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2005702327, now seen corresponding path program 1 times [2024-11-12 17:11:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384010829] [2024-11-12 17:11:55,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674933149] [2024-11-12 17:11:55,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:55,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:55,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:55,325 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-12 17:11:55,327 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-12 17:11:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:55,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:11:55,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:55,423 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-12 17:11:55,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:11:55,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384010829] [2024-11-12 17:11:55,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674933149] [2024-11-12 17:11:55,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674933149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:55,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:55,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478716397] [2024-11-12 17:11:55,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:55,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:11:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:11:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:11:55,429 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-12 17:11:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:55,517 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2024-11-12 17:11:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:11:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-12 17:11:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:55,519 INFO L225 Difference]: With dead ends: 160 [2024-11-12 17:11:55,519 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 17:11:55,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-12 17:11:55,522 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 142 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 17:11:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2024-11-12 17:11:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 117 states have internal predecessors, (142), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:11:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2024-11-12 17:11:55,541 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 16 [2024-11-12 17:11:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2024-11-12 17:11:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-12 17:11:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2024-11-12 17:11:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 17:11:55,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:55,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:11:55,561 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-12 17:11:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:55,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -960377671, now seen corresponding path program 1 times [2024-11-12 17:11:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146749717] [2024-11-12 17:11:55,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666541409] [2024-11-12 17:11:55,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:55,767 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-12 17:11:55,768 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-12 17:11:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:55,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:11:55,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:55,904 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-12 17:11:55,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:11:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146749717] [2024-11-12 17:11:55,905 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666541409] [2024-11-12 17:11:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666541409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:55,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:11:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268173420] [2024-11-12 17:11:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:55,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:11:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:11:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:11:55,911 INFO L87 Difference]: Start difference. First operand 132 states and 166 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, (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-12 17:11:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:56,074 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2024-11-12 17:11:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:11:56,075 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-12 17:11:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:56,076 INFO L225 Difference]: With dead ends: 153 [2024-11-12 17:11:56,076 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 17:11:56,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:56,077 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 182 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:56,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 17:11:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2024-11-12 17:11:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 118 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:11:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2024-11-12 17:11:56,087 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 18 [2024-11-12 17:11:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:56,088 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2024-11-12 17:11:56,088 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, (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-12 17:11:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2024-11-12 17:11:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 17:11:56,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:56,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:11:56,108 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-12 17:11:56,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:56,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 293063337, now seen corresponding path program 1 times [2024-11-12 17:11:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91139523] [2024-11-12 17:11:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580673889] [2024-11-12 17:11:56,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:56,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:56,319 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-12 17:11:56,321 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-12 17:11:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:56,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:11:56,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:56,436 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-12 17:11:56,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:11:56,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91139523] [2024-11-12 17:11:56,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580673889] [2024-11-12 17:11:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580673889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:11:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845929201] [2024-11-12 17:11:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:11:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:56,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:11:56,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:11:56,439 INFO L87 Difference]: Start difference. First operand 133 states and 165 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, (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-12 17:11:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:56,584 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2024-11-12 17:11:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:11:56,584 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, (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 19 [2024-11-12 17:11:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:56,585 INFO L225 Difference]: With dead ends: 153 [2024-11-12 17:11:56,585 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 17:11:56,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:56,586 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:56,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 17:11:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2024-11-12 17:11:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.646341463414634) internal successors, (135), 115 states have internal predecessors, (135), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 17:11:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2024-11-12 17:11:56,597 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 19 [2024-11-12 17:11:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2024-11-12 17:11:56,597 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, (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-12 17:11:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2024-11-12 17:11:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:11:56,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:56,598 INFO L218 NwaCegarLoop]: trace histogram [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-12 17:11:56,615 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-12 17:11:56,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:56,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1200878525, now seen corresponding path program 1 times [2024-11-12 17:11:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323920059] [2024-11-12 17:11:56,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:56,986 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-12 17:11:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323920059] [2024-11-12 17:11:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323920059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:11:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242201979] [2024-11-12 17:11:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:56,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:11:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:11:56,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:11:56,988 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-12 17:11:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:57,055 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2024-11-12 17:11:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:11:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 27 [2024-11-12 17:11:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:57,058 INFO L225 Difference]: With dead ends: 179 [2024-11-12 17:11:57,058 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 17:11:57,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:11:57,060 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:57,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 121 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 17:11:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-11-12 17:11:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-12 17:11:57,070 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 27 [2024-11-12 17:11:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:57,072 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-12 17:11:57,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-12 17:11:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-12 17:11:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:11:57,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:57,073 INFO L218 NwaCegarLoop]: trace histogram [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-12 17:11:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:11:57,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1427471308, now seen corresponding path program 1 times [2024-11-12 17:11:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108132159] [2024-11-12 17:11:57,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,186 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-12 17:11:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108132159] [2024-11-12 17:11:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108132159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:11:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015413322] [2024-11-12 17:11:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:11:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:57,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:11:57,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:57,189 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 17:11:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:57,240 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-11-12 17:11:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:11:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 28 [2024-11-12 17:11:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:57,242 INFO L225 Difference]: With dead ends: 74 [2024-11-12 17:11:57,242 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 17:11:57,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:11:57,243 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:57,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 17:11:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-12 17:11:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-12 17:11:57,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 28 [2024-11-12 17:11:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-12 17:11:57,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 17:11:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-12 17:11:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 17:11:57,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:57,260 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-12 17:11:57,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 17:11:57,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1705356828, now seen corresponding path program 1 times [2024-11-12 17:11:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187929562] [2024-11-12 17:11:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,323 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-12 17:11:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187929562] [2024-11-12 17:11:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187929562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:11:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493156351] [2024-11-12 17:11:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:57,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:11:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:11:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:11:57,327 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-12 17:11:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:57,348 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-11-12 17:11:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:11:57,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 30 [2024-11-12 17:11:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:57,351 INFO L225 Difference]: With dead ends: 65 [2024-11-12 17:11:57,351 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 17:11:57,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12 17:11:57,352 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:57,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 17:11:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-12 17:11:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 57 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-12 17:11:57,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 30 [2024-11-12 17:11:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:57,360 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-12 17:11:57,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-12 17:11:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-12 17:11:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 17:11:57,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:57,361 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-12 17:11:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 17:11:57,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:57,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1326453982, now seen corresponding path program 1 times [2024-11-12 17:11:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:57,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112847202] [2024-11-12 17:11:57,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,452 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-12 17:11:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112847202] [2024-11-12 17:11:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112847202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:11:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899472808] [2024-11-12 17:11:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:11:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:11:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:11:57,454 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 17:11:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:57,820 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-12 17:11:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:11:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 31 [2024-11-12 17:11:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:57,821 INFO L225 Difference]: With dead ends: 75 [2024-11-12 17:11:57,821 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 17:11:57,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:11:57,822 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:57,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 17:11:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 17:11:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-11-12 17:11:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 63 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-12 17:11:57,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 31 [2024-11-12 17:11:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:57,829 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-12 17:11:57,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 17:11:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-12 17:11:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 17:11:57,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:57,831 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-12 17:11:57,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 17:11:57,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:57,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1829599654, now seen corresponding path program 1 times [2024-11-12 17:11:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921552512] [2024-11-12 17:11:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:57,903 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-12 17:11:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:57,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921552512] [2024-11-12 17:11:57,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921552512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:57,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:11:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034299367] [2024-11-12 17:11:57,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:57,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:11:57,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:57,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:11:57,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:11:57,905 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-12 17:11:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:57,999 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-12 17:11:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:11:57,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2024-11-12 17:11:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:58,000 INFO L225 Difference]: With dead ends: 74 [2024-11-12 17:11:58,000 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 17:11:58,001 INFO L434 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-12 17:11:58,001 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:58,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 17:11:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 17:11:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 65 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-12 17:11:58,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 32 [2024-11-12 17:11:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:58,008 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-12 17:11:58,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-12 17:11:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-12 17:11:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 17:11:58,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:58,013 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-12 17:11:58,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 17:11:58,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash -787768118, now seen corresponding path program 1 times [2024-11-12 17:11:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:58,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817830702] [2024-11-12 17:11:58,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:58,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:11:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:11:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:11:58,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817830702] [2024-11-12 17:11:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817830702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:11:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988382317] [2024-11-12 17:11:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:58,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:11:58,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:58,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:11:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:11:58,103 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-12 17:11:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:58,187 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2024-11-12 17:11:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:11:58,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 36 [2024-11-12 17:11:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:58,189 INFO L225 Difference]: With dead ends: 80 [2024-11-12 17:11:58,189 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 17:11:58,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:11:58,189 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:58,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 190 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:11:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 17:11:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2024-11-12 17:11:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 64 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-12 17:11:58,203 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 36 [2024-11-12 17:11:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:58,204 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-12 17:11:58,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-12 17:11:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-12 17:11:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 17:11:58,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:58,205 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-12 17:11:58,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 17:11:58,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1130915578, now seen corresponding path program 1 times [2024-11-12 17:11:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135618] [2024-11-12 17:11:58,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091467501] [2024-11-12 17:11:58,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:58,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:58,227 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-12 17:11:58,229 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-12 17:11:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:58,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 17:11:58,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:11:58,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:11:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135618] [2024-11-12 17:11:58,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091467501] [2024-11-12 17:11:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091467501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:11:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:11:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:11:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605334766] [2024-11-12 17:11:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:11:58,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:11:58,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:11:58,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:11:58,532 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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-12 17:11:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:11:58,647 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-12 17:11:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:11:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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 38 [2024-11-12 17:11:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:11:58,649 INFO L225 Difference]: With dead ends: 71 [2024-11-12 17:11:58,649 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 17:11:58,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:11:58,650 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:11:58,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 104 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:11:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 17:11:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 17:11:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:11:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-12 17:11:58,655 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 38 [2024-11-12 17:11:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:11:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-12 17:11:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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-12 17:11:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-12 17:11:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 17:11:58,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:11:58,656 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-12 17:11:58,673 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-12 17:11:58,857 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-12 17:11:58,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:11:58,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:11:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -698644405, now seen corresponding path program 1 times [2024-11-12 17:11:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:11:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830153226] [2024-11-12 17:11:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:11:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:11:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37140260] [2024-11-12 17:11:58,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:11:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:11:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:11:58,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:11:58,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:11:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:11:58,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 17:11:58,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:11:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:11:59,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:11:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:11:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830153226] [2024-11-12 17:11:59,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:11:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37140260] [2024-11-12 17:11:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37140260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:11:59,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:11:59,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-12 17:11:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309953298] [2024-11-12 17:11:59,923 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 17:11:59,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:11:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:11:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:11:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:11:59,924 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-12 17:12:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:12:00,028 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-12 17:12:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:12:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 39 [2024-11-12 17:12:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:12:00,029 INFO L225 Difference]: With dead ends: 95 [2024-11-12 17:12:00,029 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 17:12:00,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:12:00,030 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:12:00,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 88 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:12:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 17:12:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2024-11-12 17:12:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 73 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:12:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-12 17:12:00,039 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 39 [2024-11-12 17:12:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:12:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-12 17:12:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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-12 17:12:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-12 17:12:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 17:12:00,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:12:00,040 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-12 17:12:00,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 17:12:00,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 17:12:00,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:12:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:12:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -698645299, now seen corresponding path program 1 times [2024-11-12 17:12:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:12:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606793584] [2024-11-12 17:12:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:12:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:12:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:12:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:12:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:12:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:12:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606793584] [2024-11-12 17:12:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606793584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:12:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:12:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:12:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159803983] [2024-11-12 17:12:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:12:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:12:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:12:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:12:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:12:00,296 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 17:12:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:12:00,330 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-12 17:12:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:12:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 39 [2024-11-12 17:12:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:12:00,331 INFO L225 Difference]: With dead ends: 88 [2024-11-12 17:12:00,331 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 17:12:00,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:12:00,332 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:12:00,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:12:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 17:12:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-12 17:12:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:12:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-12 17:12:00,336 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 39 [2024-11-12 17:12:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:12:00,336 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-12 17:12:00,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 17:12:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-12 17:12:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 17:12:00,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:12:00,337 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 17:12:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 17:12:00,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:12:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:12:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -183139928, now seen corresponding path program 1 times [2024-11-12 17:12:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:12:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974254279] [2024-11-12 17:12:00,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:12:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:12:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:12:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 17:12:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:12:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:12:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974254279] [2024-11-12 17:12:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974254279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:12:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:12:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:12:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757264641] [2024-11-12 17:12:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:12:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:12:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:12:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:12:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:12:00,394 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-12 17:12:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:12:00,486 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-11-12 17:12:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:12:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 40 [2024-11-12 17:12:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:12:00,487 INFO L225 Difference]: With dead ends: 39 [2024-11-12 17:12:00,488 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 17:12:00,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:12:00,488 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:12:00,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:12:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 17:12:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 17:12:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:12:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-12 17:12:00,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 40 [2024-11-12 17:12:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:12:00,493 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-11-12 17:12:00,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-12 17:12:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-12 17:12:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 17:12:00,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:12:00,493 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:12:00,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 17:12:00,494 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2024-11-12 17:12:00,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:12:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1382370323, now seen corresponding path program 1 times [2024-11-12 17:12:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:12:00,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994314246] [2024-11-12 17:12:00,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:12:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:12:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:12:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934221384] [2024-11-12 17:12:00,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:12:00,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:12:00,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:12:00,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:12:00,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:12:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:12:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 17:12:00,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:12:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:12:00,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:12:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:12:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994314246] [2024-11-12 17:12:08,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:12:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934221384] [2024-11-12 17:12:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934221384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:12:08,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:12:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-12 17:12:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836520006] [2024-11-12 17:12:08,074 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 17:12:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:12:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:12:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:12:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=81, Unknown=2, NotChecked=0, Total=110 [2024-11-12 17:12:08,075 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-12 17:12:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:12:08,214 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-11-12 17:12:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:12:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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 41 [2024-11-12 17:12:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:12:08,214 INFO L225 Difference]: With dead ends: 38 [2024-11-12 17:12:08,215 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:12:08,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=52, Invalid=156, Unknown=2, NotChecked=0, Total=210 [2024-11-12 17:12:08,215 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:12:08,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:12:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:12:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:12:08,216 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-12 17:12:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:12:08,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-12 17:12:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:12:08,216 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:12:08,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 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-12 17:12:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:12:08,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:12:08,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 34 remaining) [2024-11-12 17:12:08,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 34 remaining) [2024-11-12 17:12:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 34 remaining) [2024-11-12 17:12:08,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 34 remaining) [2024-11-12 17:12:08,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 34 remaining) [2024-11-12 17:12:08,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 34 remaining) [2024-11-12 17:12:08,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 34 remaining) [2024-11-12 17:12:08,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 34 remaining) [2024-11-12 17:12:08,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 17:12:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:12:08,431 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:12:08,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:12:08,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:12:08,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:12:08 BoogieIcfgContainer [2024-11-12 17:12:08,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:12:08,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:12:08,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:12:08,685 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:12:08,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:54" (3/4) ... [2024-11-12 17:12:08,687 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:12:08,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:12:08,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-12 17:12:08,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:12:08,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:12:08,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:12:08,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:12:08,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:12:08,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:12:08,802 INFO L158 Benchmark]: Toolchain (without parser) took 15556.29ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 139.8MB in the beginning and 89.8MB in the end (delta: 50.0MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,802 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 172.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:12:08,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.53ms. Allocated memory is still 172.0MB. Free memory was 139.2MB in the beginning and 126.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.24ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:12:08,803 INFO L158 Benchmark]: Boogie Preprocessor took 29.59ms. Allocated memory is still 172.0MB. Free memory was 125.1MB in the beginning and 123.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,803 INFO L158 Benchmark]: RCFGBuilder took 537.58ms. Allocated memory is still 172.0MB. Free memory was 123.3MB in the beginning and 106.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,804 INFO L158 Benchmark]: TraceAbstraction took 14592.00ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 105.6MB in the beginning and 95.0MB in the end (delta: 10.6MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,804 INFO L158 Benchmark]: Witness Printer took 117.58ms. Allocated memory is still 222.3MB. Free memory was 95.0MB in the beginning and 89.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:12:08,805 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.98ms. Allocated memory is still 172.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.53ms. Allocated memory is still 172.0MB. Free memory was 139.2MB in the beginning and 126.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.24ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.59ms. Allocated memory is still 172.0MB. Free memory was 125.1MB in the beginning and 123.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.58ms. Allocated memory is still 172.0MB. Free memory was 123.3MB in the beginning and 106.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14592.00ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 105.6MB in the beginning and 95.0MB in the end (delta: 10.6MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Witness Printer took 117.58ms. Allocated memory is still 222.3MB. Free memory was 95.0MB in the beginning and 89.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: 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, 95 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 829 mSDsluCounter, 2386 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1390 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 850 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 996 mSDtfsCounter, 850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=6, InterpolantAutomatonStates: 91, 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, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1793 SizeOfPredicates, 7 NumberOfNonLiveVariables, 531 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 61/69 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 34 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((1 <= y) && (x <= 2147483647)) && (r <= 2147483647)) && (b == y)) && (a == 1)) && (0 <= (x + 2147483648))) && (q == 0)) && (b <= r)) && (counter == 1)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((1 <= y) && (x <= 2147483647)) && (0 <= r)) && (0 <= (x + 2147483648))) && (q == 1)) && (1 <= a)) && (((__int128) r + y) <= 2147483647)) && (counter == 2)) || (((((((((1 <= y) && (x <= 2147483647)) && (r <= 2147483647)) && (0 <= (x + 2147483648))) && (q == 0)) && (counter == 0)) && (a == 0)) && (y <= 2147483647)) && (0 <= ((__int128) r + 2147483648)))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:12:08,837 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