./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:06:26,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:06:26,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:06:26,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:06:26,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:06:26,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:06:26,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:06:26,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:06:26,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:06:26,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:06:26,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:06:26,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:06:26,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:06:26,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:06:26,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:06:26,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:06:26,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:06:26,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:06:26,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:06:26,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:06:26,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:06:26,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:06:26,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:06:26,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:06:26,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:06:26,501 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:06:26,501 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:06:26,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:06:26,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:06:26,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:06:26,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:06:26,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:06:26,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:06:26,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:06:26,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:06:26,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:06:26,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:06:26,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:06:26,504 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2024-11-09 11:06:26,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:06:26,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:06:26,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:06:26,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:06:26,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:06:26,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2024-11-09 11:06:27,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:06:28,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:06:28,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2024-11-09 11:06:28,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c84ea7e/69f713afed6d4ffc9abc12d69ad7a197/FLAG1d2960946 [2024-11-09 11:06:28,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c84ea7e/69f713afed6d4ffc9abc12d69ad7a197 [2024-11-09 11:06:28,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:06:28,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:06:28,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:06:28,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:06:28,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:06:28,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54702a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28, skipping insertion in model container [2024-11-09 11:06:28,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:06:28,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:06:28,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:06:28,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:06:28,838 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:06:28,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28 WrapperNode [2024-11-09 11:06:28,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:06:28,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:06:28,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:06:28,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:06:28,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,899 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 192 [2024-11-09 11:06:28,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:06:28,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:06:28,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:06:28,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:06:28,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,947 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:06:28,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:06:28,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:06:28,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:06:28,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:06:28,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (1/1) ... [2024-11-09 11:06:28,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:06:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:29,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:06:29,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:06:29,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:06:29,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:06:29,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:06:29,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:06:29,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:06:29,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:06:29,402 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-09 11:06:29,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:06:29,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:06:29,414 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:06:29,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:06:29 BoogieIcfgContainer [2024-11-09 11:06:29,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:06:29,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:06:29,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:06:29,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:06:29,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:06:28" (1/3) ... [2024-11-09 11:06:29,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245f0684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:06:29, skipping insertion in model container [2024-11-09 11:06:29,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:06:28" (2/3) ... [2024-11-09 11:06:29,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245f0684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:06:29, skipping insertion in model container [2024-11-09 11:06:29,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:06:29" (3/3) ... [2024-11-09 11:06:29,421 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2024-11-09 11:06:29,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:06:29,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-09 11:06:29,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:06:29,499 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;@557891fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:06:29,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-09 11:06:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:06:29,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:29,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:06:29,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:29,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2024-11-09 11:06:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:29,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876311049] [2024-11-09 11:06:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:06:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876311049] [2024-11-09 11:06:29,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876311049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:29,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 11:06:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408345674] [2024-11-09 11:06:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:29,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:06:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:06:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:06:29,806 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:29,827 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2024-11-09 11:06:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:06:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-09 11:06:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:29,841 INFO L225 Difference]: With dead ends: 167 [2024-11-09 11:06:29,841 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 11:06:29,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-09 11:06:29,847 INFO L432 NwaCegarLoop]: 123 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, 123 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-09 11:06:29,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:06:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 11:06:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 11:06:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-09 11:06:29,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 4 [2024-11-09 11:06:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-09 11:06:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-09 11:06:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:06:29,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:29,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:06:29,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:29,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1213044638, now seen corresponding path program 1 times [2024-11-09 11:06:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638740707] [2024-11-09 11:06:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:06:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638740707] [2024-11-09 11:06:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638740707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:06:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554938464] [2024-11-09 11:06:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:06:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:06:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:06:30,119 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:30,250 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2024-11-09 11:06:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:06:30,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 11:06:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:30,253 INFO L225 Difference]: With dead ends: 165 [2024-11-09 11:06:30,254 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 11:06:30,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:06:30,256 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:30,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 11:06:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-09 11:06:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2024-11-09 11:06:30,269 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 19 [2024-11-09 11:06:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:30,269 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2024-11-09 11:06:30,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2024-11-09 11:06:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:06:30,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:30,270 INFO L215 NwaCegarLoop]: trace histogram [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-09 11:06:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:06:30,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:30,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1776244864, now seen corresponding path program 1 times [2024-11-09 11:06:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312714958] [2024-11-09 11:06:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:06:30,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312714958] [2024-11-09 11:06:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312714958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:30,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:06:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147986413] [2024-11-09 11:06:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:30,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:30,443 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:30,749 INFO L93 Difference]: Finished difference Result 234 states and 345 transitions. [2024-11-09 11:06:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:06:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-09 11:06:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:30,751 INFO L225 Difference]: With dead ends: 234 [2024-11-09 11:06:30,751 INFO L226 Difference]: Without dead ends: 177 [2024-11-09 11:06:30,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:06:30,752 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:30,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 205 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:06:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-09 11:06:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129. [2024-11-09 11:06:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2024-11-09 11:06:30,761 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 26 [2024-11-09 11:06:30,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2024-11-09 11:06:30,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2024-11-09 11:06:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:06:30,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:30,763 INFO L215 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] [2024-11-09 11:06:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:06:30,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1932025242, now seen corresponding path program 1 times [2024-11-09 11:06:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110476456] [2024-11-09 11:06:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:06:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110476456] [2024-11-09 11:06:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110476456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:06:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207710001] [2024-11-09 11:06:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:30,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:30,883 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:31,013 INFO L93 Difference]: Finished difference Result 335 states and 454 transitions. [2024-11-09 11:06:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 33 [2024-11-09 11:06:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:31,016 INFO L225 Difference]: With dead ends: 335 [2024-11-09 11:06:31,016 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 11:06:31,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 11:06:31,018 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:31,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 310 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 11:06:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142. [2024-11-09 11:06:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-09 11:06:31,052 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 33 [2024-11-09 11:06:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:31,052 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-09 11:06:31,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-09 11:06:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:06:31,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:31,057 INFO L215 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-09 11:06:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:06:31,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 880692086, now seen corresponding path program 1 times [2024-11-09 11:06:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906541446] [2024-11-09 11:06:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:06:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906541446] [2024-11-09 11:06:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906541446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:31,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:06:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98346070] [2024-11-09 11:06:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:31,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:31,276 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:31,398 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2024-11-09 11:06:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2024-11-09 11:06:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:31,400 INFO L225 Difference]: With dead ends: 341 [2024-11-09 11:06:31,400 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 11:06:31,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 11:06:31,403 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:31,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 11:06:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2024-11-09 11:06:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 154 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2024-11-09 11:06:31,411 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 36 [2024-11-09 11:06:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2024-11-09 11:06:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2024-11-09 11:06:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:06:31,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:31,413 INFO L215 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, 1, 1, 1] [2024-11-09 11:06:31,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:06:31,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161921, now seen corresponding path program 1 times [2024-11-09 11:06:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:31,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477966074] [2024-11-09 11:06:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:06:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:31,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477966074] [2024-11-09 11:06:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477966074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139030952] [2024-11-09 11:06:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:31,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:31,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:31,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:06:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:31,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:06:31,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:06:31,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:06:31,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139030952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:06:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 11:06:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117966415] [2024-11-09 11:06:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:31,639 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:31,783 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions. [2024-11-09 11:06:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 11:06:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:31,785 INFO L225 Difference]: With dead ends: 310 [2024-11-09 11:06:31,785 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 11:06:31,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:31,786 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 11:06:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2024-11-09 11:06:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.308108108108108) internal successors, (242), 185 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2024-11-09 11:06:31,799 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 39 [2024-11-09 11:06:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:31,799 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2024-11-09 11:06:31,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2024-11-09 11:06:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:06:31,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:31,801 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-09 11:06:31,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:06:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:06:32,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1239804479, now seen corresponding path program 1 times [2024-11-09 11:06:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177774567] [2024-11-09 11:06:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:06:32,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:32,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177774567] [2024-11-09 11:06:32,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177774567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:32,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634778259] [2024-11-09 11:06:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:32,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:32,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:32,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:32,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:06:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:32,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:06:32,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:06:32,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:06:32,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634778259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:32,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:06:32,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-09 11:06:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951959824] [2024-11-09 11:06:32,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:32,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:32,296 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:32,436 INFO L93 Difference]: Finished difference Result 372 states and 507 transitions. [2024-11-09 11:06:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-09 11:06:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:32,439 INFO L225 Difference]: With dead ends: 372 [2024-11-09 11:06:32,439 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 11:06:32,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:32,440 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:32,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 11:06:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 211. [2024-11-09 11:06:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2024-11-09 11:06:32,458 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 46 [2024-11-09 11:06:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:32,459 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2024-11-09 11:06:32,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2024-11-09 11:06:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 11:06:32,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:32,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:32,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:06:32,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 11:06:32,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1676819835, now seen corresponding path program 1 times [2024-11-09 11:06:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663912149] [2024-11-09 11:06:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 11:06:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663912149] [2024-11-09 11:06:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663912149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:32,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:32,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:06:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744811156] [2024-11-09 11:06:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:32,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:06:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:06:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:06:32,769 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:32,784 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2024-11-09 11:06:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:06:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 11:06:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:32,788 INFO L225 Difference]: With dead ends: 258 [2024-11-09 11:06:32,788 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 11:06:32,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:06:32,789 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:32,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:06:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 11:06:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-09 11:06:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-09 11:06:32,797 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 53 [2024-11-09 11:06:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:32,797 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-09 11:06:32,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-09 11:06:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:06:32,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:32,805 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:32,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:06:32,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:32,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2137686151, now seen corresponding path program 1 times [2024-11-09 11:06:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590695951] [2024-11-09 11:06:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:32,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 11:06:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590695951] [2024-11-09 11:06:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590695951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:06:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15597335] [2024-11-09 11:06:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:06:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:06:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:06:32,916 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:33,051 INFO L93 Difference]: Finished difference Result 480 states and 612 transitions. [2024-11-09 11:06:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:06:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 65 [2024-11-09 11:06:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:33,053 INFO L225 Difference]: With dead ends: 480 [2024-11-09 11:06:33,053 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 11:06:33,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:33,054 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:33,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 11:06:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2024-11-09 11:06:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 226 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2024-11-09 11:06:33,064 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 65 [2024-11-09 11:06:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:33,066 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2024-11-09 11:06:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2024-11-09 11:06:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 11:06:33,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:33,067 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:06:33,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2110196596, now seen corresponding path program 1 times [2024-11-09 11:06:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054935933] [2024-11-09 11:06:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 11:06:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054935933] [2024-11-09 11:06:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054935933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:06:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420129590] [2024-11-09 11:06:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:33,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:33,195 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:33,246 INFO L93 Difference]: Finished difference Result 513 states and 651 transitions. [2024-11-09 11:06:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:33,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 68 [2024-11-09 11:06:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:33,248 INFO L225 Difference]: With dead ends: 513 [2024-11-09 11:06:33,248 INFO L226 Difference]: Without dead ends: 337 [2024-11-09 11:06:33,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:33,249 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:33,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:06:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-09 11:06:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249. [2024-11-09 11:06:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 322 transitions. [2024-11-09 11:06:33,256 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 322 transitions. Word has length 68 [2024-11-09 11:06:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:33,257 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 322 transitions. [2024-11-09 11:06:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 322 transitions. [2024-11-09 11:06:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 11:06:33,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:33,258 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-11-09 11:06:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:06:33,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash -301960682, now seen corresponding path program 1 times [2024-11-09 11:06:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643898051] [2024-11-09 11:06:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 11:06:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643898051] [2024-11-09 11:06:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643898051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:06:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800263225] [2024-11-09 11:06:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:33,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:06:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:06:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:33,394 INFO L87 Difference]: Start difference. First operand 249 states and 322 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:33,587 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2024-11-09 11:06:33,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:06:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2024-11-09 11:06:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:33,590 INFO L225 Difference]: With dead ends: 685 [2024-11-09 11:06:33,590 INFO L226 Difference]: Without dead ends: 482 [2024-11-09 11:06:33,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:33,591 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 162 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:33,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 232 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:06:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-09 11:06:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 407. [2024-11-09 11:06:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 406 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2024-11-09 11:06:33,602 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 74 [2024-11-09 11:06:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:33,603 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2024-11-09 11:06:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2024-11-09 11:06:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 11:06:33,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:33,605 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:33,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:06:33,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:33,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash -326786310, now seen corresponding path program 1 times [2024-11-09 11:06:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:33,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762351061] [2024-11-09 11:06:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:06:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762351061] [2024-11-09 11:06:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762351061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938072231] [2024-11-09 11:06:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:33,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:33,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:06:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:33,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:06:33,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:06:33,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:06:33,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938072231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:33,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:06:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-09 11:06:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143048511] [2024-11-09 11:06:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:33,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:33,846 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:33,915 INFO L93 Difference]: Finished difference Result 1047 states and 1341 transitions. [2024-11-09 11:06:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:33,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2024-11-09 11:06:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:33,918 INFO L225 Difference]: With dead ends: 1047 [2024-11-09 11:06:33,918 INFO L226 Difference]: Without dead ends: 649 [2024-11-09 11:06:33,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:06:33,919 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:33,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-09 11:06:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 555. [2024-11-09 11:06:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 554 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions. [2024-11-09 11:06:33,931 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 74 [2024-11-09 11:06:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:33,932 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions. [2024-11-09 11:06:33,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions. [2024-11-09 11:06:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 11:06:33,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:33,933 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-11-09 11:06:33,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 11:06:34,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:34,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:34,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1468144829, now seen corresponding path program 1 times [2024-11-09 11:06:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151984066] [2024-11-09 11:06:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 11:06:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151984066] [2024-11-09 11:06:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151984066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:34,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:06:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052836956] [2024-11-09 11:06:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:34,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:06:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:06:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:34,227 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:34,396 INFO L93 Difference]: Finished difference Result 1345 states and 1704 transitions. [2024-11-09 11:06:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:06:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2024-11-09 11:06:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:34,399 INFO L225 Difference]: With dead ends: 1345 [2024-11-09 11:06:34,399 INFO L226 Difference]: Without dead ends: 794 [2024-11-09 11:06:34,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:34,400 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:34,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-09 11:06:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 696. [2024-11-09 11:06:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.2618705035971223) internal successors, (877), 695 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 877 transitions. [2024-11-09 11:06:34,415 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 877 transitions. Word has length 74 [2024-11-09 11:06:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:34,415 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 877 transitions. [2024-11-09 11:06:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 877 transitions. [2024-11-09 11:06:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 11:06:34,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:34,416 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:06:34,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2112281364, now seen corresponding path program 1 times [2024-11-09 11:06:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455606666] [2024-11-09 11:06:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:06:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455606666] [2024-11-09 11:06:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455606666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:06:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859829056] [2024-11-09 11:06:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:06:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:06:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:34,531 INFO L87 Difference]: Start difference. First operand 696 states and 877 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:34,789 INFO L93 Difference]: Finished difference Result 1731 states and 2171 transitions. [2024-11-09 11:06:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:06:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 80 [2024-11-09 11:06:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:34,792 INFO L225 Difference]: With dead ends: 1731 [2024-11-09 11:06:34,792 INFO L226 Difference]: Without dead ends: 961 [2024-11-09 11:06:34,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:06:34,793 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 198 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:34,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 319 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:06:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-09 11:06:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 826. [2024-11-09 11:06:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.2642424242424242) internal successors, (1043), 825 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1043 transitions. [2024-11-09 11:06:34,813 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1043 transitions. Word has length 80 [2024-11-09 11:06:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:34,813 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1043 transitions. [2024-11-09 11:06:34,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1043 transitions. [2024-11-09 11:06:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 11:06:34,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:34,815 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:06:34,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1262585566, now seen corresponding path program 1 times [2024-11-09 11:06:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112164274] [2024-11-09 11:06:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:06:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112164274] [2024-11-09 11:06:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112164274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697885250] [2024-11-09 11:06:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:34,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:34,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:06:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:34,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:06:34,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:06:35,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:06:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:06:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697885250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:06:35,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:06:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-09 11:06:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982547844] [2024-11-09 11:06:35,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:06:35,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:06:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:06:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:06:35,095 INFO L87 Difference]: Start difference. First operand 826 states and 1043 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:36,305 INFO L93 Difference]: Finished difference Result 4972 states and 6140 transitions. [2024-11-09 11:06:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-09 11:06:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 11:06:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:36,318 INFO L225 Difference]: With dead ends: 4972 [2024-11-09 11:06:36,318 INFO L226 Difference]: Without dead ends: 4016 [2024-11-09 11:06:36,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:06:36,322 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 842 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:36,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1470 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:06:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2024-11-09 11:06:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 1079. [2024-11-09 11:06:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.4063079777365493) internal successors, (1516), 1078 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1516 transitions. [2024-11-09 11:06:36,371 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1516 transitions. Word has length 80 [2024-11-09 11:06:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1516 transitions. [2024-11-09 11:06:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1516 transitions. [2024-11-09 11:06:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 11:06:36,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:36,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:36,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:06:36,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:06:36,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:36,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1514248837, now seen corresponding path program 1 times [2024-11-09 11:06:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352845350] [2024-11-09 11:06:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:06:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352845350] [2024-11-09 11:06:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352845350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:06:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756395143] [2024-11-09 11:06:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:36,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:06:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:36,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:06:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:36,812 INFO L87 Difference]: Start difference. First operand 1079 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:37,045 INFO L93 Difference]: Finished difference Result 2425 states and 3400 transitions. [2024-11-09 11:06:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:06:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 80 [2024-11-09 11:06:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:37,049 INFO L225 Difference]: With dead ends: 2425 [2024-11-09 11:06:37,049 INFO L226 Difference]: Without dead ends: 1331 [2024-11-09 11:06:37,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:06:37,051 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 254 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:37,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 306 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:06:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-09 11:06:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1239. [2024-11-09 11:06:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-09 11:06:37,082 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 80 [2024-11-09 11:06:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-09 11:06:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-09 11:06:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 11:06:37,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:37,084 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:06:37,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -468213532, now seen corresponding path program 1 times [2024-11-09 11:06:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639423947] [2024-11-09 11:06:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 11:06:37,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639423947] [2024-11-09 11:06:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639423947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:06:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138820805] [2024-11-09 11:06:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:06:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:06:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:06:37,282 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:37,478 INFO L93 Difference]: Finished difference Result 3836 states and 5402 transitions. [2024-11-09 11:06:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:06:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 86 [2024-11-09 11:06:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:37,488 INFO L225 Difference]: With dead ends: 3836 [2024-11-09 11:06:37,488 INFO L226 Difference]: Without dead ends: 3649 [2024-11-09 11:06:37,490 INFO L431 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-09 11:06:37,490 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 219 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:37,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 458 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2024-11-09 11:06:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 1239. [2024-11-09 11:06:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-09 11:06:37,571 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 86 [2024-11-09 11:06:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:37,571 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-09 11:06:37,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-09 11:06:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 11:06:37,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:37,574 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:06:37,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1893852281, now seen corresponding path program 1 times [2024-11-09 11:06:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742343915] [2024-11-09 11:06:37,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 11:06:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742343915] [2024-11-09 11:06:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742343915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:06:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974120991] [2024-11-09 11:06:37,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:06:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:06:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:06:37,694 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:37,897 INFO L93 Difference]: Finished difference Result 3828 states and 5390 transitions. [2024-11-09 11:06:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:06:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2024-11-09 11:06:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:37,907 INFO L225 Difference]: With dead ends: 3828 [2024-11-09 11:06:37,907 INFO L226 Difference]: Without dead ends: 3632 [2024-11-09 11:06:37,908 INFO L431 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-09 11:06:37,909 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 181 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:37,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 408 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2024-11-09 11:06:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1239. [2024-11-09 11:06:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-09 11:06:37,961 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 86 [2024-11-09 11:06:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:37,962 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-09 11:06:37,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-09 11:06:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 11:06:37,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:37,980 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:37,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 11:06:37,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1148768933, now seen corresponding path program 1 times [2024-11-09 11:06:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414583251] [2024-11-09 11:06:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 11:06:38,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:38,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414583251] [2024-11-09 11:06:38,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414583251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:38,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:38,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:06:38,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511172508] [2024-11-09 11:06:38,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:38,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:06:38,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:38,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:06:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:38,112 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:38,427 INFO L93 Difference]: Finished difference Result 5049 states and 7113 transitions. [2024-11-09 11:06:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:06:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 89 [2024-11-09 11:06:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:38,442 INFO L225 Difference]: With dead ends: 5049 [2024-11-09 11:06:38,442 INFO L226 Difference]: Without dead ends: 4862 [2024-11-09 11:06:38,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:38,444 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 329 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:38,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 708 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:06:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2024-11-09 11:06:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 1239. [2024-11-09 11:06:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-09 11:06:38,560 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 89 [2024-11-09 11:06:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:38,560 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-09 11:06:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-09 11:06:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 11:06:38,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:38,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:06:38,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1153171285, now seen corresponding path program 1 times [2024-11-09 11:06:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905900243] [2024-11-09 11:06:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 11:06:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905900243] [2024-11-09 11:06:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905900243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:06:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119135666] [2024-11-09 11:06:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:38,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:06:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:06:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:06:38,717 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:39,040 INFO L93 Difference]: Finished difference Result 5031 states and 7088 transitions. [2024-11-09 11:06:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:06:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 89 [2024-11-09 11:06:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:39,060 INFO L225 Difference]: With dead ends: 5031 [2024-11-09 11:06:39,060 INFO L226 Difference]: Without dead ends: 4835 [2024-11-09 11:06:39,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:39,065 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 271 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:39,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 606 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:06:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2024-11-09 11:06:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 1239. [2024-11-09 11:06:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-09 11:06:39,162 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 89 [2024-11-09 11:06:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:39,162 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-09 11:06:39,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-09 11:06:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 11:06:39,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:39,164 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:39,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:06:39,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:39,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 786075514, now seen corresponding path program 1 times [2024-11-09 11:06:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:39,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021626107] [2024-11-09 11:06:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:39,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 11:06:39,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:39,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021626107] [2024-11-09 11:06:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021626107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:39,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083843005] [2024-11-09 11:06:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:39,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:39,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:39,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:39,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:06:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:39,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:06:39,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 11:06:39,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:06:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:06:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083843005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:06:39,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:06:39,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2024-11-09 11:06:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858372307] [2024-11-09 11:06:39,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:06:39,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:06:39,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:39,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:06:39,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:06:39,464 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:40,072 INFO L93 Difference]: Finished difference Result 4734 states and 6934 transitions. [2024-11-09 11:06:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 11:06:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 89 [2024-11-09 11:06:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:40,077 INFO L225 Difference]: With dead ends: 4734 [2024-11-09 11:06:40,077 INFO L226 Difference]: Without dead ends: 3519 [2024-11-09 11:06:40,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:06:40,079 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 505 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:40,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 426 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:06:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2024-11-09 11:06:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 2697. [2024-11-09 11:06:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2696 states have (on average 1.3171364985163205) internal successors, (3551), 2696 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3551 transitions. [2024-11-09 11:06:40,170 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3551 transitions. Word has length 89 [2024-11-09 11:06:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:40,170 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3551 transitions. [2024-11-09 11:06:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3551 transitions. [2024-11-09 11:06:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 11:06:40,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:40,172 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:40,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:06:40,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:40,376 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1857009734, now seen corresponding path program 1 times [2024-11-09 11:06:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927010227] [2024-11-09 11:06:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 11:06:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927010227] [2024-11-09 11:06:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927010227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209568153] [2024-11-09 11:06:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:40,508 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-09 11:06:40,509 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-09 11:06:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:40,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:06:40,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 11:06:40,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:06:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209568153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:40,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:06:40,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 11:06:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335240090] [2024-11-09 11:06:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:06:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:06:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:40,614 INFO L87 Difference]: Start difference. First operand 2697 states and 3551 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:40,838 INFO L93 Difference]: Finished difference Result 5700 states and 7489 transitions. [2024-11-09 11:06:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:06:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 89 [2024-11-09 11:06:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:40,850 INFO L225 Difference]: With dead ends: 5700 [2024-11-09 11:06:40,850 INFO L226 Difference]: Without dead ends: 5251 [2024-11-09 11:06:40,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:40,853 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 47 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:40,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 236 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5251 states. [2024-11-09 11:06:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5251 to 4333. [2024-11-09 11:06:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 4332 states have (on average 1.3206371191135735) internal successors, (5721), 4332 states have internal predecessors, (5721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5721 transitions. [2024-11-09 11:06:41,136 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5721 transitions. Word has length 89 [2024-11-09 11:06:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:41,136 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5721 transitions. [2024-11-09 11:06:41,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5721 transitions. [2024-11-09 11:06:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 11:06:41,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:41,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:41,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:06:41,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:41,348 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:41,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1487226441, now seen corresponding path program 1 times [2024-11-09 11:06:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:41,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336616936] [2024-11-09 11:06:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 11:06:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:41,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336616936] [2024-11-09 11:06:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336616936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:06:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070447806] [2024-11-09 11:06:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:41,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:06:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:06:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:41,730 INFO L87 Difference]: Start difference. First operand 4333 states and 5721 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:42,695 INFO L93 Difference]: Finished difference Result 9861 states and 13068 transitions. [2024-11-09 11:06:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:06:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 91 [2024-11-09 11:06:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:42,708 INFO L225 Difference]: With dead ends: 9861 [2024-11-09 11:06:42,708 INFO L226 Difference]: Without dead ends: 9619 [2024-11-09 11:06:42,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:06:42,711 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 437 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:42,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1019 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:06:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2024-11-09 11:06:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 4312. [2024-11-09 11:06:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 4311 states have (on average 1.3208072372999304) internal successors, (5694), 4311 states have internal predecessors, (5694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5694 transitions. [2024-11-09 11:06:42,926 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5694 transitions. Word has length 91 [2024-11-09 11:06:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:42,926 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 5694 transitions. [2024-11-09 11:06:42,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5694 transitions. [2024-11-09 11:06:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 11:06:42,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:42,929 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 11:06:42,930 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181657, now seen corresponding path program 1 times [2024-11-09 11:06:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517505829] [2024-11-09 11:06:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 11:06:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517505829] [2024-11-09 11:06:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517505829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:43,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:06:43,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:06:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359481616] [2024-11-09 11:06:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:06:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:06:43,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:06:43,095 INFO L87 Difference]: Start difference. First operand 4312 states and 5694 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:43,687 INFO L93 Difference]: Finished difference Result 10981 states and 14399 transitions. [2024-11-09 11:06:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:06:43,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 91 [2024-11-09 11:06:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:43,702 INFO L225 Difference]: With dead ends: 10981 [2024-11-09 11:06:43,702 INFO L226 Difference]: Without dead ends: 10588 [2024-11-09 11:06:43,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:06:43,706 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 351 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:43,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 848 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:06:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10588 states. [2024-11-09 11:06:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10588 to 4300. [2024-11-09 11:06:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4299 states have (on average 1.3217027215631543) internal successors, (5682), 4299 states have internal predecessors, (5682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 5682 transitions. [2024-11-09 11:06:43,895 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 5682 transitions. Word has length 91 [2024-11-09 11:06:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:43,897 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 5682 transitions. [2024-11-09 11:06:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 5682 transitions. [2024-11-09 11:06:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 11:06:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:43,901 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:43,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 11:06:43,901 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1314407751, now seen corresponding path program 1 times [2024-11-09 11:06:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938688090] [2024-11-09 11:06:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:06:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938688090] [2024-11-09 11:06:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938688090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126326239] [2024-11-09 11:06:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:44,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:44,068 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-09 11:06:44,069 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-09 11:06:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:44,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:06:44,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 11:06:44,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:06:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126326239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:06:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:06:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-09 11:06:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117930570] [2024-11-09 11:06:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:06:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:06:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:06:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:44,208 INFO L87 Difference]: Start difference. First operand 4300 states and 5682 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:44,533 INFO L93 Difference]: Finished difference Result 8194 states and 10761 transitions. [2024-11-09 11:06:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:06:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 92 [2024-11-09 11:06:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:44,545 INFO L225 Difference]: With dead ends: 8194 [2024-11-09 11:06:44,546 INFO L226 Difference]: Without dead ends: 7745 [2024-11-09 11:06:44,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:06:44,549 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:44,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:06:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7745 states. [2024-11-09 11:06:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7745 to 4300. [2024-11-09 11:06:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4299 states have (on average 1.3217027215631543) internal successors, (5682), 4299 states have internal predecessors, (5682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 5682 transitions. [2024-11-09 11:06:44,787 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 5682 transitions. Word has length 92 [2024-11-09 11:06:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 5682 transitions. [2024-11-09 11:06:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 5682 transitions. [2024-11-09 11:06:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:06:44,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:44,790 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:44,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:06:44,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:44,995 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:44,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash 207179917, now seen corresponding path program 1 times [2024-11-09 11:06:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597970959] [2024-11-09 11:06:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 11:06:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597970959] [2024-11-09 11:06:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597970959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119363778] [2024-11-09 11:06:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:45,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:45,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:45,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:06:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:45,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:06:45,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 11:06:45,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:06:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:06:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119363778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:06:45,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:06:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2024-11-09 11:06:45,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612521182] [2024-11-09 11:06:45,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:06:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:06:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:06:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:06:45,483 INFO L87 Difference]: Start difference. First operand 4300 states and 5682 transitions. Second operand has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:46,769 INFO L93 Difference]: Finished difference Result 8261 states and 10881 transitions. [2024-11-09 11:06:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 11:06:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 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 95 [2024-11-09 11:06:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:46,781 INFO L225 Difference]: With dead ends: 8261 [2024-11-09 11:06:46,785 INFO L226 Difference]: Without dead ends: 4777 [2024-11-09 11:06:46,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1860, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 11:06:46,794 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1499 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:46,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1025 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 11:06:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-09 11:06:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 3536. [2024-11-09 11:06:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3535 states have (on average 1.2888260254596888) internal successors, (4556), 3535 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4556 transitions. [2024-11-09 11:06:47,109 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4556 transitions. Word has length 95 [2024-11-09 11:06:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:47,111 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 4556 transitions. [2024-11-09 11:06:47,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4556 transitions. [2024-11-09 11:06:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:06:47,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:47,116 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:47,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:06:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 11:06:47,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1252848633, now seen corresponding path program 1 times [2024-11-09 11:06:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207107072] [2024-11-09 11:06:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:06:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:06:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207107072] [2024-11-09 11:06:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207107072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:06:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383977248] [2024-11-09 11:06:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:06:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:06:47,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:06:47,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:06:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:06:47,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:06:47,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:06:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 11:06:47,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:06:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:06:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383977248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:06:47,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:06:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 18 [2024-11-09 11:06:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43607203] [2024-11-09 11:06:47,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:06:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:06:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:06:47,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:06:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:06:47,875 INFO L87 Difference]: Start difference. First operand 3536 states and 4556 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:06:49,114 INFO L93 Difference]: Finished difference Result 10340 states and 13233 transitions. [2024-11-09 11:06:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 11:06:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 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 95 [2024-11-09 11:06:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:06:49,123 INFO L225 Difference]: With dead ends: 10340 [2024-11-09 11:06:49,123 INFO L226 Difference]: Without dead ends: 5859 [2024-11-09 11:06:49,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:06:49,129 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1663 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:06:49,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 732 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:06:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5859 states. [2024-11-09 11:06:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5859 to 4813. [2024-11-09 11:06:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 4812 states have (on average 1.2676641729010807) internal successors, (6100), 4812 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6100 transitions. [2024-11-09 11:06:49,457 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6100 transitions. Word has length 95 [2024-11-09 11:06:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:06:49,457 INFO L471 AbstractCegarLoop]: Abstraction has 4813 states and 6100 transitions. [2024-11-09 11:06:49,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:06:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6100 transitions. [2024-11-09 11:06:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 11:06:49,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:06:49,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:06:49,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:06:49,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 11:06:49,663 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-09 11:06:49,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:06:49,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167465, now seen corresponding path program 1 times [2024-11-09 11:06:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:06:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817090998] [2024-11-09 11:06:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:06:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:06:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:06:49,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:06:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:06:49,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 11:06:49,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:06:49,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-11-09 11:06:49,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-11-09 11:06:49,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-11-09 11:06:49,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-11-09 11:06:49,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-11-09 11:06:49,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-11-09 11:06:49,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-11-09 11:06:49,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-11-09 11:06:49,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-11-09 11:06:49,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 11:06:49,788 INFO L407 BasicCegarLoop]: Path program histogram: [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-09 11:06:49,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:06:49,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:06:49 BoogieIcfgContainer [2024-11-09 11:06:49,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:06:49,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:06:49,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:06:49,837 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:06:49,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:06:29" (3/4) ... [2024-11-09 11:06:49,838 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 11:06:49,888 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:06:49,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:06:49,888 INFO L158 Benchmark]: Toolchain (without parser) took 21347.53ms. Allocated memory was 203.4MB in the beginning and 790.6MB in the end (delta: 587.2MB). Free memory was 173.4MB in the beginning and 494.7MB in the end (delta: -321.3MB). Peak memory consumption was 264.3MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,889 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:06:49,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.42ms. Allocated memory is still 203.4MB. Free memory was 173.2MB in the beginning and 162.3MB in the end (delta: 10.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.26ms. Allocated memory is still 203.4MB. Free memory was 162.3MB in the beginning and 157.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,889 INFO L158 Benchmark]: Boogie Preprocessor took 69.72ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 154.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,889 INFO L158 Benchmark]: RCFGBuilder took 438.32ms. Allocated memory is still 203.4MB. Free memory was 154.0MB in the beginning and 125.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,890 INFO L158 Benchmark]: TraceAbstraction took 20419.67ms. Allocated memory was 203.4MB in the beginning and 790.6MB in the end (delta: 587.2MB). Free memory was 125.5MB in the beginning and 502.1MB in the end (delta: -376.6MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,890 INFO L158 Benchmark]: Witness Printer took 51.50ms. Allocated memory is still 790.6MB. Free memory was 502.1MB in the beginning and 494.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:06:49,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.42ms. Allocated memory is still 203.4MB. Free memory was 173.2MB in the beginning and 162.3MB in the end (delta: 10.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.26ms. Allocated memory is still 203.4MB. Free memory was 162.3MB in the beginning and 157.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.72ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 154.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 438.32ms. Allocated memory is still 203.4MB. Free memory was 154.0MB in the beginning and 125.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20419.67ms. Allocated memory was 203.4MB in the beginning and 790.6MB in the end (delta: 587.2MB). Free memory was 125.5MB in the beginning and 502.1MB in the end (delta: -376.6MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. * Witness Printer took 51.50ms. Allocated memory is still 790.6MB. Free memory was 502.1MB in the beginning and 494.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1] [L68] nb = (unsigned char)4 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L90] COND TRUE i == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=4, na=1, nb=4, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, i=4, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r1 << 8U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r2=0, r3=128] [L116] EXPR r2 << 16U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r2=0, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r3=128] [L116] r3 << 24U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7938 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7938 mSDsluCounter, 12062 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8659 mSDsCounter, 637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7566 IncrementalHoareTripleChecker+Invalid, 8203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 637 mSolverCounterUnsat, 3403 mSDtfsCounter, 7566 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1432 GetRequests, 1145 SyntacticMatches, 6 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4813occurred in iteration=27, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 35000 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2639 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2861 ConstructedInterpolants, 0 QuantifiedInterpolants, 7288 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2362/2575 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 11:06:49,942 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)