./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mbpr5.c --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/array-tiling/mbpr5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:03:22,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:03:22,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:03:22,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:03:22,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:03:22,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:03:22,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:03:22,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:03:22,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:03:22,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:03:22,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:03:22,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:03:22,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:03:22,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:03:22,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:03:22,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:03:22,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:03:22,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:03:22,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:03:22,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:03:22,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:03:22,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:03:22,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:03:22,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:03:22,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:03:22,719 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:03:22,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:03:22,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:03:22,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:03:22,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:03:22,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:03:22,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:03:22,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:03:22,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:03:22,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:22,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:03:22,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:03:22,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:03:22,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:03:22,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:03:22,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:03:22,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:03:22,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:03:22,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:03:22,725 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 -> 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b [2024-11-09 11:03:22,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:03:23,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:03:23,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:03:23,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:03:23,011 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:03:23,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr5.c [2024-11-09 11:03:24,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:03:24,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:03:24,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2024-11-09 11:03:24,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55f44570/1418fd0a177341c29b798cf293a6e15c/FLAGe26969f13 [2024-11-09 11:03:24,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55f44570/1418fd0a177341c29b798cf293a6e15c [2024-11-09 11:03:24,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:03:24,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:03:24,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:24,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:03:24,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:03:24,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:24" (1/1) ... [2024-11-09 11:03:24,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2166cb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:24, skipping insertion in model container [2024-11-09 11:03:24,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:24" (1/1) ... [2024-11-09 11:03:24,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:03:24,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:25,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:03:25,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:25,074 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:03:25,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25 WrapperNode [2024-11-09 11:03:25,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:25,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:25,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:03:25,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:03:25,083 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:03:25" (1/1) ... [2024-11-09 11:03:25,097 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:03:25" (1/1) ... [2024-11-09 11:03:25,133 INFO L138 Inliner]: procedures = 15, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 405 [2024-11-09 11:03:25,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:25,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:03:25,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:03:25,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:03:25,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,168 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 8, 52]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 30 writes are split as follows [0, 0, 30]. [2024-11-09 11:03:25,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:03:25,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:03:25,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:03:25,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:03:25,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (1/1) ... [2024-11-09 11:03:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:25,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:25,275 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:03:25,283 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:03:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:03:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:03:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:03:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:03:25,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:03:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:03:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:03:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 11:03:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:03:25,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:03:25,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:03:26,272 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2024-11-09 11:03:26,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:03:26,312 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:03:26,312 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 11:03:26,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:26 BoogieIcfgContainer [2024-11-09 11:03:26,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:03:26,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:03:26,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:03:26,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:03:26,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:03:24" (1/3) ... [2024-11-09 11:03:26,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73913c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:26, skipping insertion in model container [2024-11-09 11:03:26,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:25" (2/3) ... [2024-11-09 11:03:26,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73913c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:26, skipping insertion in model container [2024-11-09 11:03:26,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:26" (3/3) ... [2024-11-09 11:03:26,321 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2024-11-09 11:03:26,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:03:26,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 222 error locations. [2024-11-09 11:03:26,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:03:26,425 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;@733ce761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:03:26,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 222 error locations. [2024-11-09 11:03:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 483 states, 260 states have (on average 1.9384615384615385) internal successors, (504), 482 states have internal predecessors, (504), 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:03:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:03:26,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:26,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:26,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1804997193, now seen corresponding path program 1 times [2024-11-09 11:03:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737378033] [2024-11-09 11:03:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737378033] [2024-11-09 11:03:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737378033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:03:26,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940754435] [2024-11-09 11:03:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:03:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:03:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:03:26,675 INFO L87 Difference]: Start difference. First operand has 483 states, 260 states have (on average 1.9384615384615385) internal successors, (504), 482 states have internal predecessors, (504), 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, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:26,723 INFO L93 Difference]: Finished difference Result 960 states and 999 transitions. [2024-11-09 11:03:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:03:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:03:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:26,738 INFO L225 Difference]: With dead ends: 960 [2024-11-09 11:03:26,738 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 11:03:26,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:03:26,745 INFO L432 NwaCegarLoop]: 495 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, 495 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:03:26,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 11:03:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2024-11-09 11:03:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 254 states have (on average 1.9173228346456692) internal successors, (487), 475 states have internal predecessors, (487), 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:03:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 487 transitions. [2024-11-09 11:03:26,796 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 487 transitions. Word has length 7 [2024-11-09 11:03:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:26,796 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 487 transitions. [2024-11-09 11:03:26,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 487 transitions. [2024-11-09 11:03:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:03:26,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:26,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:26,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:03:26,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1804999115, now seen corresponding path program 1 times [2024-11-09 11:03:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562375160] [2024-11-09 11:03:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:27,046 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:03:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562375160] [2024-11-09 11:03:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562375160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:27,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:27,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955806688] [2024-11-09 11:03:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:27,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:27,053 INFO L87 Difference]: Start difference. First operand 476 states and 487 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:27,151 INFO L93 Difference]: Finished difference Result 476 states and 487 transitions. [2024-11-09 11:03:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:03:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:27,154 INFO L225 Difference]: With dead ends: 476 [2024-11-09 11:03:27,154 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 11:03:27,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:03:27,157 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 476 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:27,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 455 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 11:03:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2024-11-09 11:03:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 254 states have (on average 1.8976377952755905) internal successors, (482), 470 states have internal predecessors, (482), 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:03:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 482 transitions. [2024-11-09 11:03:27,188 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 482 transitions. Word has length 7 [2024-11-09 11:03:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:27,191 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 482 transitions. [2024-11-09 11:03:27,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 482 transitions. [2024-11-09 11:03:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:03:27,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:27,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:27,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:03:27,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:27,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash 120397771, now seen corresponding path program 1 times [2024-11-09 11:03:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:27,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735642468] [2024-11-09 11:03:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:27,378 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:03:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:27,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735642468] [2024-11-09 11:03:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735642468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:27,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:27,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:03:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490814292] [2024-11-09 11:03:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:27,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:27,383 INFO L87 Difference]: Start difference. First operand 471 states and 482 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:03:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:27,460 INFO L93 Difference]: Finished difference Result 471 states and 482 transitions. [2024-11-09 11:03:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-11-09 11:03:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:27,463 INFO L225 Difference]: With dead ends: 471 [2024-11-09 11:03:27,463 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 11:03:27,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:27,467 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 944 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:27,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 454 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 11:03:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-09 11:03:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 254 states have (on average 1.8779527559055118) internal successors, (477), 465 states have internal predecessors, (477), 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:03:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 477 transitions. [2024-11-09 11:03:27,484 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 477 transitions. Word has length 8 [2024-11-09 11:03:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 477 transitions. [2024-11-09 11:03:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:03:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 477 transitions. [2024-11-09 11:03:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:03:27,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:27,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:03:27,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 472362386, now seen corresponding path program 1 times [2024-11-09 11:03:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641263232] [2024-11-09 11:03:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:27,553 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:03:27,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641263232] [2024-11-09 11:03:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641263232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:03:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947825998] [2024-11-09 11:03:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:27,555 INFO L87 Difference]: Start difference. First operand 466 states and 477 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:03:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:28,422 INFO L93 Difference]: Finished difference Result 891 states and 912 transitions. [2024-11-09 11:03:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 11:03:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:28,425 INFO L225 Difference]: With dead ends: 891 [2024-11-09 11:03:28,425 INFO L226 Difference]: Without dead ends: 691 [2024-11-09 11:03:28,426 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:03:28,427 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 221 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:28,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 307 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 11:03:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-09 11:03:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 686. [2024-11-09 11:03:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 474 states have (on average 1.4915611814345993) internal successors, (707), 685 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:03:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 707 transitions. [2024-11-09 11:03:28,442 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 707 transitions. Word has length 11 [2024-11-09 11:03:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:28,443 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 707 transitions. [2024-11-09 11:03:28,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:03:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 707 transitions. [2024-11-09 11:03:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:03:28,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:28,445 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:03:28,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -90746786, now seen corresponding path program 1 times [2024-11-09 11:03:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475450497] [2024-11-09 11:03:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:28,563 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:03:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475450497] [2024-11-09 11:03:28,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475450497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:28,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092319892] [2024-11-09 11:03:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:28,567 INFO L87 Difference]: Start difference. First operand 686 states and 707 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:03:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:28,998 INFO L93 Difference]: Finished difference Result 696 states and 718 transitions. [2024-11-09 11:03:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:03:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:29,001 INFO L225 Difference]: With dead ends: 696 [2024-11-09 11:03:29,001 INFO L226 Difference]: Without dead ends: 694 [2024-11-09 11:03:29,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:29,006 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 2 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:29,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 985 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-09 11:03:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2024-11-09 11:03:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 482 states have (on average 1.4854771784232366) internal successors, (716), 693 states have internal predecessors, (716), 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:03:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 716 transitions. [2024-11-09 11:03:29,027 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 716 transitions. Word has length 33 [2024-11-09 11:03:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:29,027 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 716 transitions. [2024-11-09 11:03:29,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:03:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 716 transitions. [2024-11-09 11:03:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:03:29,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:29,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:03:29,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2035311826, now seen corresponding path program 1 times [2024-11-09 11:03:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088621043] [2024-11-09 11:03:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:03:29,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:29,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088621043] [2024-11-09 11:03:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088621043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:03:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708911005] [2024-11-09 11:03:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:29,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:29,302 INFO L87 Difference]: Start difference. First operand 694 states and 716 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:30,012 INFO L93 Difference]: Finished difference Result 1254 states and 1294 transitions. [2024-11-09 11:03:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 41 [2024-11-09 11:03:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:30,016 INFO L225 Difference]: With dead ends: 1254 [2024-11-09 11:03:30,016 INFO L226 Difference]: Without dead ends: 699 [2024-11-09 11:03:30,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:03:30,022 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 916 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:30,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 283 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 11:03:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-09 11:03:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 694. [2024-11-09 11:03:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 482 states have (on average 1.4751037344398341) internal successors, (711), 693 states have internal predecessors, (711), 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:03:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 711 transitions. [2024-11-09 11:03:30,039 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 711 transitions. Word has length 41 [2024-11-09 11:03:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:30,039 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 711 transitions. [2024-11-09 11:03:30,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:03:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 711 transitions. [2024-11-09 11:03:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 11:03:30,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:30,044 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, 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:03:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:03:30,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 164750708, now seen corresponding path program 1 times [2024-11-09 11:03:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427010416] [2024-11-09 11:03:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:30,132 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:03:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427010416] [2024-11-09 11:03:30,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427010416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:30,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:30,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815897368] [2024-11-09 11:03:30,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:30,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:30,135 INFO L87 Difference]: Start difference. First operand 694 states and 711 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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:03:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:30,747 INFO L93 Difference]: Finished difference Result 703 states and 720 transitions. [2024-11-09 11:03:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-11-09 11:03:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:30,751 INFO L225 Difference]: With dead ends: 703 [2024-11-09 11:03:30,751 INFO L226 Difference]: Without dead ends: 701 [2024-11-09 11:03:30,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:30,754 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 186 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:30,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 571 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:03:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-09 11:03:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2024-11-09 11:03:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 485 states have (on average 1.4721649484536083) internal successors, (714), 696 states have internal predecessors, (714), 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:03:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 714 transitions. [2024-11-09 11:03:30,767 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 714 transitions. Word has length 48 [2024-11-09 11:03:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:30,769 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 714 transitions. [2024-11-09 11:03:30,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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:03:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 714 transitions. [2024-11-09 11:03:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:03:30,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:30,772 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:03:30,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1727595592, now seen corresponding path program 1 times [2024-11-09 11:03:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177595862] [2024-11-09 11:03:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:30,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177595862] [2024-11-09 11:03:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177595862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192571213] [2024-11-09 11:03:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:30,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:30,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:03:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:30,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:30,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:31,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192571213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:31,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754170814] [2024-11-09 11:03:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:31,083 INFO L87 Difference]: Start difference. First operand 697 states and 714 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:03:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:31,881 INFO L93 Difference]: Finished difference Result 701 states and 718 transitions. [2024-11-09 11:03:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:31,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 54 [2024-11-09 11:03:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:31,884 INFO L225 Difference]: With dead ends: 701 [2024-11-09 11:03:31,884 INFO L226 Difference]: Without dead ends: 680 [2024-11-09 11:03:31,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:31,885 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 226 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:31,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 509 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 11:03:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-09 11:03:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2024-11-09 11:03:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 485 states have (on average 1.4288659793814433) internal successors, (693), 675 states have internal predecessors, (693), 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:03:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 693 transitions. [2024-11-09 11:03:31,900 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 693 transitions. Word has length 54 [2024-11-09 11:03:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:31,901 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 693 transitions. [2024-11-09 11:03:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:03:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 693 transitions. [2024-11-09 11:03:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:03:31,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:31,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:31,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:32,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:32,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2015855734, now seen corresponding path program 1 times [2024-11-09 11:03:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722805783] [2024-11-09 11:03:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722805783] [2024-11-09 11:03:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722805783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628712611] [2024-11-09 11:03:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:32,190 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:03:32,193 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:03:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:32,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:32,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:32,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:32,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628712611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:32,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:32,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 11:03:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30917307] [2024-11-09 11:03:32,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:03:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:03:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:32,427 INFO L87 Difference]: Start difference. First operand 676 states and 693 transitions. Second operand has 10 states, 9 states have (on average 16.555555555555557) internal successors, (149), 10 states have internal predecessors, (149), 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:03:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:33,340 INFO L93 Difference]: Finished difference Result 738 states and 779 transitions. [2024-11-09 11:03:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:03:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.555555555555557) internal successors, (149), 10 states have internal predecessors, (149), 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 55 [2024-11-09 11:03:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:33,345 INFO L225 Difference]: With dead ends: 738 [2024-11-09 11:03:33,345 INFO L226 Difference]: Without dead ends: 645 [2024-11-09 11:03:33,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:33,347 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 605 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:33,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 252 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 11:03:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-09 11:03:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 637. [2024-11-09 11:03:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 536 states have (on average 1.2276119402985075) internal successors, (658), 636 states have internal predecessors, (658), 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:03:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 658 transitions. [2024-11-09 11:03:33,362 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 658 transitions. Word has length 55 [2024-11-09 11:03:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:33,363 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 658 transitions. [2024-11-09 11:03:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.555555555555557) internal successors, (149), 10 states have internal predecessors, (149), 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:03:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 658 transitions. [2024-11-09 11:03:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:03:33,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:33,364 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:33,568 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,SelfDestructingSolverStorable8 [2024-11-09 11:03:33,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:33,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1955834724, now seen corresponding path program 1 times [2024-11-09 11:03:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119454695] [2024-11-09 11:03:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119454695] [2024-11-09 11:03:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119454695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619938342] [2024-11-09 11:03:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:33,695 INFO L87 Difference]: Start difference. First operand 637 states and 658 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:03:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:33,714 INFO L93 Difference]: Finished difference Result 1096 states and 1130 transitions. [2024-11-09 11:03:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:03:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:33,718 INFO L225 Difference]: With dead ends: 1096 [2024-11-09 11:03:33,718 INFO L226 Difference]: Without dead ends: 626 [2024-11-09 11:03:33,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:03:33,719 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 304 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:33,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 348 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-09 11:03:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2024-11-09 11:03:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 528 states have (on average 1.2215909090909092) internal successors, (645), 625 states have internal predecessors, (645), 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:03:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 645 transitions. [2024-11-09 11:03:33,731 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 645 transitions. Word has length 95 [2024-11-09 11:03:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:33,732 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 645 transitions. [2024-11-09 11:03:33,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:03:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 645 transitions. [2024-11-09 11:03:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:03:33,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:33,733 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:03:33,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:33,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1867867758, now seen corresponding path program 1 times [2024-11-09 11:03:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673725172] [2024-11-09 11:03:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673725172] [2024-11-09 11:03:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673725172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:33,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048538100] [2024-11-09 11:03:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:33,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:33,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:33,836 INFO L87 Difference]: Start difference. First operand 626 states and 645 transitions. Second operand has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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:03:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:34,300 INFO L93 Difference]: Finished difference Result 638 states and 657 transitions. [2024-11-09 11:03:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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:03:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:34,302 INFO L225 Difference]: With dead ends: 638 [2024-11-09 11:03:34,302 INFO L226 Difference]: Without dead ends: 636 [2024-11-09 11:03:34,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:34,303 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 181 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 339 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-09 11:03:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 630. [2024-11-09 11:03:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 532 states have (on average 1.2199248120300752) internal successors, (649), 629 states have internal predecessors, (649), 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:03:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 649 transitions. [2024-11-09 11:03:34,315 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 649 transitions. Word has length 95 [2024-11-09 11:03:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:34,316 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 649 transitions. [2024-11-09 11:03:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.0) internal successors, (93), 4 states have internal predecessors, (93), 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:03:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 649 transitions. [2024-11-09 11:03:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 11:03:34,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:34,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:03:34,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1895016918, now seen corresponding path program 1 times [2024-11-09 11:03:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598828835] [2024-11-09 11:03:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598828835] [2024-11-09 11:03:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598828835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176395329] [2024-11-09 11:03:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:34,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:34,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:34,433 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:03:34,434 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:03:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:34,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:34,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:34,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176395329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:34,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532189155] [2024-11-09 11:03:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:34,603 INFO L87 Difference]: Start difference. First operand 630 states and 649 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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:03:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:35,140 INFO L93 Difference]: Finished difference Result 636 states and 655 transitions. [2024-11-09 11:03:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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 101 [2024-11-09 11:03:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:35,143 INFO L225 Difference]: With dead ends: 636 [2024-11-09 11:03:35,143 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 11:03:35,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:35,144 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 216 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:35,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 338 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:03:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 11:03:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2024-11-09 11:03:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 532 states have (on average 1.1842105263157894) internal successors, (630), 610 states have internal predecessors, (630), 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:03:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 630 transitions. [2024-11-09 11:03:35,158 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 630 transitions. Word has length 101 [2024-11-09 11:03:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:35,158 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 630 transitions. [2024-11-09 11:03:35,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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:03:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 630 transitions. [2024-11-09 11:03:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 11:03:35,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:35,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:35,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:03:35,360 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:03:35,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1384017512, now seen corresponding path program 1 times [2024-11-09 11:03:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689086568] [2024-11-09 11:03:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689086568] [2024-11-09 11:03:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689086568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466435618] [2024-11-09 11:03:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:35,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:35,474 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:03:35,475 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:03:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:35,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:35,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:35,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:03:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466435618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:35,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 11:03:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178618069] [2024-11-09 11:03:35,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:03:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:35,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:03:35,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:35,761 INFO L87 Difference]: Start difference. First operand 611 states and 630 transitions. Second operand has 10 states, 9 states have (on average 21.555555555555557) internal successors, (194), 10 states have internal predecessors, (194), 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:03:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:36,574 INFO L93 Difference]: Finished difference Result 668 states and 690 transitions. [2024-11-09 11:03:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:03:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 21.555555555555557) internal successors, (194), 10 states have internal predecessors, (194), 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 102 [2024-11-09 11:03:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:36,576 INFO L225 Difference]: With dead ends: 668 [2024-11-09 11:03:36,577 INFO L226 Difference]: Without dead ends: 666 [2024-11-09 11:03:36,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:36,578 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 580 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:36,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 378 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 11:03:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-09 11:03:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 660. [2024-11-09 11:03:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 581 states have (on average 1.1721170395869192) internal successors, (681), 659 states have internal predecessors, (681), 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:03:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 681 transitions. [2024-11-09 11:03:36,591 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 681 transitions. Word has length 102 [2024-11-09 11:03:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 681 transitions. [2024-11-09 11:03:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 21.555555555555557) internal successors, (194), 10 states have internal predecessors, (194), 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:03:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 681 transitions. [2024-11-09 11:03:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 11:03:36,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:36,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:36,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:36,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1590657565, now seen corresponding path program 1 times [2024-11-09 11:03:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102688617] [2024-11-09 11:03:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 11:03:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102688617] [2024-11-09 11:03:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102688617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:36,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098531318] [2024-11-09 11:03:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:36,897 INFO L87 Difference]: Start difference. First operand 660 states and 681 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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:03:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:37,290 INFO L93 Difference]: Finished difference Result 660 states and 681 transitions. [2024-11-09 11:03:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 135 [2024-11-09 11:03:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:37,293 INFO L225 Difference]: With dead ends: 660 [2024-11-09 11:03:37,293 INFO L226 Difference]: Without dead ends: 659 [2024-11-09 11:03:37,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:37,294 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 191 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:37,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 185 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-09 11:03:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-11-09 11:03:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 581 states have (on average 1.1703958691910499) internal successors, (680), 658 states have internal predecessors, (680), 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:03:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 680 transitions. [2024-11-09 11:03:37,306 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 680 transitions. Word has length 135 [2024-11-09 11:03:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:37,306 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 680 transitions. [2024-11-09 11:03:37,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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:03:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 680 transitions. [2024-11-09 11:03:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 11:03:37,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:37,308 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:03:37,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1407844406, now seen corresponding path program 2 times [2024-11-09 11:03:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598419658] [2024-11-09 11:03:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-09 11:03:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598419658] [2024-11-09 11:03:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598419658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203696170] [2024-11-09 11:03:37,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:37,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:37,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:37,697 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:03:37,699 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:03:37,768 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:03:37,768 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:37,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-09 11:03:38,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-09 11:03:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203696170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:38,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2024-11-09 11:03:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930799567] [2024-11-09 11:03:38,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:38,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:03:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:03:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:03:38,520 INFO L87 Difference]: Start difference. First operand 659 states and 680 transitions. Second operand has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 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:03:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:38,918 INFO L93 Difference]: Finished difference Result 659 states and 680 transitions. [2024-11-09 11:03:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:03:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 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 141 [2024-11-09 11:03:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:38,921 INFO L225 Difference]: With dead ends: 659 [2024-11-09 11:03:38,921 INFO L226 Difference]: Without dead ends: 650 [2024-11-09 11:03:38,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:03:38,924 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1718 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:38,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 64 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-09 11:03:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 545. [2024-11-09 11:03:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 476 states have (on average 1.1764705882352942) internal successors, (560), 544 states have internal predecessors, (560), 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:03:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 560 transitions. [2024-11-09 11:03:38,934 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 560 transitions. Word has length 141 [2024-11-09 11:03:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:38,934 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 560 transitions. [2024-11-09 11:03:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.875) internal successors, (151), 9 states have internal predecessors, (151), 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:03:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 560 transitions. [2024-11-09 11:03:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 11:03:38,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:38,936 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,953 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:03:39,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 11:03:39,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:39,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1241673046, now seen corresponding path program 1 times [2024-11-09 11:03:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472643110] [2024-11-09 11:03:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:03:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472643110] [2024-11-09 11:03:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472643110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474188143] [2024-11-09 11:03:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:39,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:39,278 INFO L87 Difference]: Start difference. First operand 545 states and 560 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:03:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:39,297 INFO L93 Difference]: Finished difference Result 884 states and 909 transitions. [2024-11-09 11:03:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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) Word has length 142 [2024-11-09 11:03:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:39,299 INFO L225 Difference]: With dead ends: 884 [2024-11-09 11:03:39,299 INFO L226 Difference]: Without dead ends: 535 [2024-11-09 11:03:39,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:03:39,300 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 223 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:39,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-09 11:03:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-11-09 11:03:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 468 states have (on average 1.170940170940171) internal successors, (548), 534 states have internal predecessors, (548), 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:03:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 548 transitions. [2024-11-09 11:03:39,310 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 548 transitions. Word has length 142 [2024-11-09 11:03:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:39,310 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 548 transitions. [2024-11-09 11:03:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:03:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 548 transitions. [2024-11-09 11:03:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 11:03:39,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:39,329 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:39,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:03:39,329 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:39,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1153706080, now seen corresponding path program 1 times [2024-11-09 11:03:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:39,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736747548] [2024-11-09 11:03:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:03:39,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:39,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736747548] [2024-11-09 11:03:39,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736747548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766621763] [2024-11-09 11:03:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:39,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:39,427 INFO L87 Difference]: Start difference. First operand 535 states and 548 transitions. Second operand has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 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:03:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:39,876 INFO L93 Difference]: Finished difference Result 587 states and 601 transitions. [2024-11-09 11:03:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 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) Word has length 142 [2024-11-09 11:03:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:39,878 INFO L225 Difference]: With dead ends: 587 [2024-11-09 11:03:39,879 INFO L226 Difference]: Without dead ends: 585 [2024-11-09 11:03:39,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:39,879 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 176 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:39,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 272 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-09 11:03:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 539. [2024-11-09 11:03:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 472 states have (on average 1.1694915254237288) internal successors, (552), 538 states have internal predecessors, (552), 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:03:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 552 transitions. [2024-11-09 11:03:39,893 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 552 transitions. Word has length 142 [2024-11-09 11:03:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:39,894 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 552 transitions. [2024-11-09 11:03:39,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 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:03:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 552 transitions. [2024-11-09 11:03:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 11:03:39,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:39,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:39,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:03:39,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash 270904804, now seen corresponding path program 1 times [2024-11-09 11:03:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:39,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66010975] [2024-11-09 11:03:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:03:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66010975] [2024-11-09 11:03:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66010975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835467974] [2024-11-09 11:03:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:40,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:40,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:40,012 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:03:40,015 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:03:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:40,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:40,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:03:40,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835467974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:40,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:40,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:40,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389590709] [2024-11-09 11:03:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:40,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:40,182 INFO L87 Difference]: Start difference. First operand 539 states and 552 transitions. Second operand has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 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:03:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:40,688 INFO L93 Difference]: Finished difference Result 585 states and 599 transitions. [2024-11-09 11:03:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 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 148 [2024-11-09 11:03:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:40,691 INFO L225 Difference]: With dead ends: 585 [2024-11-09 11:03:40,691 INFO L226 Difference]: Without dead ends: 566 [2024-11-09 11:03:40,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:40,692 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 211 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:40,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 270 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:03:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-09 11:03:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 520. [2024-11-09 11:03:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 472 states have (on average 1.1292372881355932) internal successors, (533), 519 states have internal predecessors, (533), 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:03:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 533 transitions. [2024-11-09 11:03:40,702 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 533 transitions. Word has length 148 [2024-11-09 11:03:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 533 transitions. [2024-11-09 11:03:40,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 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:03:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 533 transitions. [2024-11-09 11:03:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 11:03:40,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:40,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:40,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:03:40,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:03:40,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:40,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash -815668239, now seen corresponding path program 1 times [2024-11-09 11:03:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901236703] [2024-11-09 11:03:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 11:03:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901236703] [2024-11-09 11:03:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901236703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:41,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:41,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292949039] [2024-11-09 11:03:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:41,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:41,029 INFO L87 Difference]: Start difference. First operand 520 states and 533 transitions. Second operand has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 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:03:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:41,380 INFO L93 Difference]: Finished difference Result 525 states and 539 transitions. [2024-11-09 11:03:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 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 182 [2024-11-09 11:03:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:41,382 INFO L225 Difference]: With dead ends: 525 [2024-11-09 11:03:41,382 INFO L226 Difference]: Without dead ends: 524 [2024-11-09 11:03:41,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:41,383 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 186 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:41,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 154 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-09 11:03:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 436. [2024-11-09 11:03:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.1516709511568124) internal successors, (448), 435 states have internal predecessors, (448), 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:03:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 448 transitions. [2024-11-09 11:03:41,393 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 448 transitions. Word has length 182 [2024-11-09 11:03:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:41,394 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 448 transitions. [2024-11-09 11:03:41,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.0) internal successors, (132), 4 states have internal predecessors, (132), 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:03:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 448 transitions. [2024-11-09 11:03:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 11:03:41,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:41,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:03:41,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:41,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -653542027, now seen corresponding path program 1 times [2024-11-09 11:03:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443939797] [2024-11-09 11:03:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443939797] [2024-11-09 11:03:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443939797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:41,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150642364] [2024-11-09 11:03:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:41,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:41,501 INFO L87 Difference]: Start difference. First operand 436 states and 448 transitions. Second operand has 4 states, 3 states have (on average 59.0) internal successors, (177), 4 states have internal predecessors, (177), 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:03:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:41,858 INFO L93 Difference]: Finished difference Result 444 states and 457 transitions. [2024-11-09 11:03:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.0) internal successors, (177), 4 states have internal predecessors, (177), 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 186 [2024-11-09 11:03:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:41,860 INFO L225 Difference]: With dead ends: 444 [2024-11-09 11:03:41,860 INFO L226 Difference]: Without dead ends: 443 [2024-11-09 11:03:41,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:41,861 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 186 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:41,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 151 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-09 11:03:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 395. [2024-11-09 11:03:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 349 states have (on average 1.166189111747851) internal successors, (407), 394 states have internal predecessors, (407), 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:03:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 407 transitions. [2024-11-09 11:03:41,869 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 407 transitions. Word has length 186 [2024-11-09 11:03:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:41,869 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 407 transitions. [2024-11-09 11:03:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.0) internal successors, (177), 4 states have internal predecessors, (177), 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:03:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 407 transitions. [2024-11-09 11:03:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 11:03:41,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:41,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:03:41,872 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -642961986, now seen corresponding path program 1 times [2024-11-09 11:03:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796793704] [2024-11-09 11:03:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:41,977 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:03:41,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:41,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796793704] [2024-11-09 11:03:41,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796793704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:41,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:41,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:41,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159984701] [2024-11-09 11:03:41,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:41,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:41,979 INFO L87 Difference]: Start difference. First operand 395 states and 407 transitions. Second operand has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 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:03:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:42,438 INFO L93 Difference]: Finished difference Result 521 states and 534 transitions. [2024-11-09 11:03:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 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 189 [2024-11-09 11:03:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:42,441 INFO L225 Difference]: With dead ends: 521 [2024-11-09 11:03:42,441 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 11:03:42,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:42,441 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 176 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:42,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 227 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 11:03:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 399. [2024-11-09 11:03:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 353 states have (on average 1.1643059490084986) internal successors, (411), 398 states have internal predecessors, (411), 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:03:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 411 transitions. [2024-11-09 11:03:42,450 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 411 transitions. Word has length 189 [2024-11-09 11:03:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:42,450 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 411 transitions. [2024-11-09 11:03:42,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.0) internal successors, (183), 4 states have internal predecessors, (183), 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:03:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 411 transitions. [2024-11-09 11:03:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-09 11:03:42,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:42,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 11:03:42,453 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 522812930, now seen corresponding path program 1 times [2024-11-09 11:03:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881663222] [2024-11-09 11:03:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:03:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881663222] [2024-11-09 11:03:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881663222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113634215] [2024-11-09 11:03:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:42,598 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:03:42,600 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:03:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:42,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:42,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:03:42,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:42,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113634215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:42,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:42,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:42,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948262118] [2024-11-09 11:03:42,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:42,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:42,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:42,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:42,794 INFO L87 Difference]: Start difference. First operand 399 states and 411 transitions. Second operand has 5 states, 4 states have (on average 47.25) internal successors, (189), 5 states have internal predecessors, (189), 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:03:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:43,276 INFO L93 Difference]: Finished difference Result 519 states and 532 transitions. [2024-11-09 11:03:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 47.25) internal successors, (189), 5 states have internal predecessors, (189), 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 195 [2024-11-09 11:03:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:43,279 INFO L225 Difference]: With dead ends: 519 [2024-11-09 11:03:43,279 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 11:03:43,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:43,280 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 216 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:43,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 203 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:03:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 11:03:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 378. [2024-11-09 11:03:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 353 states have (on average 1.1048158640226629) internal successors, (390), 377 states have internal predecessors, (390), 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:03:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 390 transitions. [2024-11-09 11:03:43,287 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 390 transitions. Word has length 195 [2024-11-09 11:03:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 390 transitions. [2024-11-09 11:03:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 47.25) internal successors, (189), 5 states have internal predecessors, (189), 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:03:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 390 transitions. [2024-11-09 11:03:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 11:03:43,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:43,290 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,308 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:03:43,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:43,492 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:43,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2059769965, now seen corresponding path program 1 times [2024-11-09 11:03:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174720005] [2024-11-09 11:03:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:43,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:43,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174720005] [2024-11-09 11:03:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174720005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:43,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729849225] [2024-11-09 11:03:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:43,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:43,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:43,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:43,597 INFO L87 Difference]: Start difference. First operand 378 states and 390 transitions. Second operand has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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:03:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:43,878 INFO L93 Difference]: Finished difference Result 389 states and 402 transitions. [2024-11-09 11:03:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:43,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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 233 [2024-11-09 11:03:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:43,880 INFO L225 Difference]: With dead ends: 389 [2024-11-09 11:03:43,880 INFO L226 Difference]: Without dead ends: 388 [2024-11-09 11:03:43,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:43,881 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 186 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:43,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 141 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-09 11:03:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 333. [2024-11-09 11:03:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 309 states have (on average 1.1132686084142396) internal successors, (344), 332 states have internal predecessors, (344), 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:03:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 344 transitions. [2024-11-09 11:03:43,890 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 344 transitions. Word has length 233 [2024-11-09 11:03:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:43,891 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 344 transitions. [2024-11-09 11:03:43,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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:03:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 344 transitions. [2024-11-09 11:03:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 11:03:43,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:43,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 11:03:43,894 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -468350516, now seen corresponding path program 1 times [2024-11-09 11:03:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320209956] [2024-11-09 11:03:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320209956] [2024-11-09 11:03:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320209956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519726796] [2024-11-09 11:03:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:44,047 INFO L87 Difference]: Start difference. First operand 333 states and 344 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:03:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:44,061 INFO L93 Difference]: Finished difference Result 446 states and 461 transitions. [2024-11-09 11:03:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:44,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 236 [2024-11-09 11:03:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:44,063 INFO L225 Difference]: With dead ends: 446 [2024-11-09 11:03:44,064 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 11:03:44,064 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:03:44,064 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 83 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:44,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 265 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 11:03:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-09 11:03:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 301 states have (on average 1.1029900332225913) internal successors, (332), 322 states have internal predecessors, (332), 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:03:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 332 transitions. [2024-11-09 11:03:44,071 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 332 transitions. Word has length 236 [2024-11-09 11:03:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:44,072 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 332 transitions. [2024-11-09 11:03:44,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:03:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 332 transitions. [2024-11-09 11:03:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 11:03:44,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:44,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:44,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 11:03:44,074 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:44,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -556317482, now seen corresponding path program 1 times [2024-11-09 11:03:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693080788] [2024-11-09 11:03:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:44,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693080788] [2024-11-09 11:03:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693080788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091906915] [2024-11-09 11:03:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:44,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:44,237 INFO L87 Difference]: Start difference. First operand 323 states and 332 transitions. Second operand has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 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:03:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:44,611 INFO L93 Difference]: Finished difference Result 489 states and 500 transitions. [2024-11-09 11:03:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:44,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 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 236 [2024-11-09 11:03:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:44,614 INFO L225 Difference]: With dead ends: 489 [2024-11-09 11:03:44,614 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 11:03:44,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:44,615 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 171 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:44,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 174 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 11:03:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 327. [2024-11-09 11:03:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 305 states have (on average 1.1016393442622952) internal successors, (336), 326 states have internal predecessors, (336), 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:03:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 336 transitions. [2024-11-09 11:03:44,623 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 336 transitions. Word has length 236 [2024-11-09 11:03:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:44,623 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 336 transitions. [2024-11-09 11:03:44,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.0) internal successors, (228), 4 states have internal predecessors, (228), 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:03:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 336 transitions. [2024-11-09 11:03:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 11:03:44,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:44,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:44,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 11:03:44,631 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:44,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2144604966, now seen corresponding path program 1 times [2024-11-09 11:03:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633895568] [2024-11-09 11:03:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633895568] [2024-11-09 11:03:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633895568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772095992] [2024-11-09 11:03:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:44,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:44,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:44,793 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:03:44,794 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:03:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:44,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:44,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:03:45,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772095992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:45,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 11:03:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716925622] [2024-11-09 11:03:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:45,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:45,051 INFO L87 Difference]: Start difference. First operand 327 states and 336 transitions. Second operand has 5 states, 4 states have (on average 58.5) internal successors, (234), 5 states have internal predecessors, (234), 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:03:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:45,548 INFO L93 Difference]: Finished difference Result 487 states and 498 transitions. [2024-11-09 11:03:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:03:45,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 58.5) internal successors, (234), 5 states have internal predecessors, (234), 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 242 [2024-11-09 11:03:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:45,550 INFO L225 Difference]: With dead ends: 487 [2024-11-09 11:03:45,550 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 11:03:45,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:03:45,551 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 206 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:45,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 166 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:03:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 11:03:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 308. [2024-11-09 11:03:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 305 states have (on average 1.039344262295082) internal successors, (317), 307 states have internal predecessors, (317), 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:03:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 317 transitions. [2024-11-09 11:03:45,561 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 317 transitions. Word has length 242 [2024-11-09 11:03:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:45,561 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 317 transitions. [2024-11-09 11:03:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 58.5) internal successors, (234), 5 states have internal predecessors, (234), 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:03:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 317 transitions. [2024-11-09 11:03:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-09 11:03:45,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:45,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:45,764 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:03:45,765 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:45,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1217634922, now seen corresponding path program 1 times [2024-11-09 11:03:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:45,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508580325] [2024-11-09 11:03:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:45,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508580325] [2024-11-09 11:03:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508580325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741795625] [2024-11-09 11:03:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:45,975 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:03:45,977 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:03:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:46,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:46,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:46,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:46,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741795625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:46,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:03:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557288661] [2024-11-09 11:03:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:46,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:46,175 INFO L87 Difference]: Start difference. First operand 308 states and 317 transitions. Second operand has 6 states, 5 states have (on average 49.2) internal successors, (246), 6 states have internal predecessors, (246), 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:03:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:46,604 INFO L93 Difference]: Finished difference Result 468 states and 479 transitions. [2024-11-09 11:03:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 49.2) internal successors, (246), 6 states have internal predecessors, (246), 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 256 [2024-11-09 11:03:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:46,606 INFO L225 Difference]: With dead ends: 468 [2024-11-09 11:03:46,606 INFO L226 Difference]: Without dead ends: 467 [2024-11-09 11:03:46,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:46,607 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 423 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:46,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 184 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:03:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-09 11:03:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 307. [2024-11-09 11:03:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 305 states have (on average 1.0360655737704918) internal successors, (316), 306 states have internal predecessors, (316), 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:03:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 316 transitions. [2024-11-09 11:03:46,614 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 316 transitions. Word has length 256 [2024-11-09 11:03:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:46,615 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 316 transitions. [2024-11-09 11:03:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 49.2) internal successors, (246), 6 states have internal predecessors, (246), 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:03:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 316 transitions. [2024-11-09 11:03:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-09 11:03:46,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:46,616 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,635 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:03:46,817 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:03:46,817 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 908023701, now seen corresponding path program 1 times [2024-11-09 11:03:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778751058] [2024-11-09 11:03:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:47,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778751058] [2024-11-09 11:03:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778751058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465439026] [2024-11-09 11:03:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:47,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:47,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:47,007 INFO L229 MonitoredProcess]: Starting monitored process 11 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:03:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:03:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:47,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:47,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:47,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465439026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:47,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 11:03:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450013596] [2024-11-09 11:03:47,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:47,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:03:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:47,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:03:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:47,263 INFO L87 Difference]: Start difference. First operand 307 states and 316 transitions. Second operand has 12 states, 11 states have (on average 24.818181818181817) internal successors, (273), 12 states have internal predecessors, (273), 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:03:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:47,924 INFO L93 Difference]: Finished difference Result 492 states and 508 transitions. [2024-11-09 11:03:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:03:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.818181818181817) internal successors, (273), 12 states have internal predecessors, (273), 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 257 [2024-11-09 11:03:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:47,929 INFO L225 Difference]: With dead ends: 492 [2024-11-09 11:03:47,930 INFO L226 Difference]: Without dead ends: 491 [2024-11-09 11:03:47,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:03:47,930 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 564 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:47,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 298 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:03:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-09 11:03:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 331. [2024-11-09 11:03:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 329 states have (on average 1.0425531914893618) internal successors, (343), 330 states have internal predecessors, (343), 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:03:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 343 transitions. [2024-11-09 11:03:47,938 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 343 transitions. Word has length 257 [2024-11-09 11:03:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:47,938 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 343 transitions. [2024-11-09 11:03:47,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.818181818181817) internal successors, (273), 12 states have internal predecessors, (273), 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:03:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 343 transitions. [2024-11-09 11:03:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-09 11:03:47,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:47,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 11:03:48,141 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:48,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -730502687, now seen corresponding path program 1 times [2024-11-09 11:03:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425683324] [2024-11-09 11:03:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:03:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425683324] [2024-11-09 11:03:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425683324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307694803] [2024-11-09 11:03:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:48,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:48,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:48,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:48,271 INFO L87 Difference]: Start difference. First operand 331 states and 343 transitions. Second operand has 4 states, 3 states have (on average 89.0) internal successors, (267), 4 states have internal predecessors, (267), 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:03:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:48,540 INFO L93 Difference]: Finished difference Result 347 states and 361 transitions. [2024-11-09 11:03:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 89.0) internal successors, (267), 4 states have internal predecessors, (267), 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 280 [2024-11-09 11:03:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:48,542 INFO L225 Difference]: With dead ends: 347 [2024-11-09 11:03:48,542 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 11:03:48,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:48,543 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 181 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:48,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 125 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:03:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 11:03:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 290. [2024-11-09 11:03:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.0449826989619377) internal successors, (302), 289 states have internal predecessors, (302), 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:03:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 302 transitions. [2024-11-09 11:03:48,549 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 302 transitions. Word has length 280 [2024-11-09 11:03:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 302 transitions. [2024-11-09 11:03:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 89.0) internal successors, (267), 4 states have internal predecessors, (267), 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:03:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 302 transitions. [2024-11-09 11:03:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-09 11:03:48,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:48,551 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 11:03:48,551 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2024-11-09 11:03:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash -85648091, now seen corresponding path program 2 times [2024-11-09 11:03:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540834768] [2024-11-09 11:03:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:48,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540834768] [2024-11-09 11:03:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540834768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958956426] [2024-11-09 11:03:48,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:48,871 INFO L229 MonitoredProcess]: Starting monitored process 12 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:03:48,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:03:49,009 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:03:49,010 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:49,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:49,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 11:03:49,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 11:03:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958956426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:49,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-09 11:03:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589314577] [2024-11-09 11:03:49,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:03:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:03:49,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:03:49,626 INFO L87 Difference]: Start difference. First operand 290 states and 302 transitions. Second operand has 15 states, 14 states have (on average 36.92857142857143) internal successors, (517), 15 states have internal predecessors, (517), 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:03:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:50,455 INFO L93 Difference]: Finished difference Result 497 states and 513 transitions. [2024-11-09 11:03:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:03:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 36.92857142857143) internal successors, (517), 15 states have internal predecessors, (517), 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 281 [2024-11-09 11:03:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:50,456 INFO L225 Difference]: With dead ends: 497 [2024-11-09 11:03:50,456 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:03:50,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 558 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-09 11:03:50,457 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 651 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:50,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 150 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 11:03:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:03:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:03:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:03:50,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2024-11-09 11:03:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:03:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 36.92857142857143) internal successors, (517), 15 states have internal predecessors, (517), 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:03:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:03:50,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (221 of 222 remaining) [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (220 of 222 remaining) [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (219 of 222 remaining) [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (218 of 222 remaining) [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (217 of 222 remaining) [2024-11-09 11:03:50,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (216 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (215 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (214 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (213 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (212 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (211 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (210 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (209 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (208 of 222 remaining) [2024-11-09 11:03:50,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (207 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (206 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (205 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (204 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (203 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (202 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (201 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (200 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (199 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (198 of 222 remaining) [2024-11-09 11:03:50,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (197 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (196 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (195 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (194 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (193 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (192 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (191 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (190 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (189 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (188 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 222 remaining) [2024-11-09 11:03:50,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 222 remaining) [2024-11-09 11:03:50,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 222 remaining) [2024-11-09 11:03:50,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 222 remaining) [2024-11-09 11:03:50,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 222 remaining) [2024-11-09 11:03:50,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 222 remaining) [2024-11-09 11:03:50,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 222 remaining) [2024-11-09 11:03:50,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 222 remaining) [2024-11-09 11:03:50,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 222 remaining) [2024-11-09 11:03:50,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 222 remaining) [2024-11-09 11:03:50,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 222 remaining) [2024-11-09 11:03:50,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 222 remaining) [2024-11-09 11:03:50,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 222 remaining) [2024-11-09 11:03:50,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 222 remaining) [2024-11-09 11:03:50,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 222 remaining) [2024-11-09 11:03:50,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 222 remaining) [2024-11-09 11:03:50,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 222 remaining) [2024-11-09 11:03:50,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 222 remaining) [2024-11-09 11:03:50,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 222 remaining) [2024-11-09 11:03:50,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 222 remaining) [2024-11-09 11:03:50,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 222 remaining) [2024-11-09 11:03:50,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 222 remaining) [2024-11-09 11:03:50,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 222 remaining) [2024-11-09 11:03:50,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 222 remaining) [2024-11-09 11:03:50,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 222 remaining) [2024-11-09 11:03:50,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 222 remaining) [2024-11-09 11:03:50,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 222 remaining) [2024-11-09 11:03:50,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 222 remaining) [2024-11-09 11:03:50,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 222 remaining) [2024-11-09 11:03:50,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 222 remaining) [2024-11-09 11:03:50,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 222 remaining) [2024-11-09 11:03:50,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 222 remaining) [2024-11-09 11:03:50,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 222 remaining) [2024-11-09 11:03:50,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 222 remaining) [2024-11-09 11:03:50,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 222 remaining) [2024-11-09 11:03:50,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:50,694 INFO L407 BasicCegarLoop]: Path program histogram: [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:03:50,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:03:51,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:03:51,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:03:51 BoogieIcfgContainer [2024-11-09 11:03:51,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:03:51,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:03:51,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:03:51,036 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:03:51,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:26" (3/4) ... [2024-11-09 11:03:51,039 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:03:51,055 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 11:03:51,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-09 11:03:51,057 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:03:51,057 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:03:51,058 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:03:51,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:03:51,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:03:51,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:03:51,212 INFO L158 Benchmark]: Toolchain (without parser) took 26511.11ms. Allocated memory was 163.6MB in the beginning and 333.4MB in the end (delta: 169.9MB). Free memory was 107.0MB in the beginning and 205.1MB in the end (delta: -98.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,212 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 163.6MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:03:51,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 91.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.02ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 87.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,212 INFO L158 Benchmark]: Boogie Preprocessor took 79.75ms. Allocated memory is still 163.6MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,212 INFO L158 Benchmark]: RCFGBuilder took 1095.38ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 84.9MB in the beginning and 171.2MB in the end (delta: -86.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,213 INFO L158 Benchmark]: TraceAbstraction took 24720.37ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 171.2MB in the beginning and 216.6MB in the end (delta: -45.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,213 INFO L158 Benchmark]: Witness Printer took 175.41ms. Allocated memory is still 333.4MB. Free memory was 216.6MB in the beginning and 205.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:03:51,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 163.6MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.12ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 91.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.02ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 87.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.75ms. Allocated memory is still 163.6MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.38ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 84.9MB in the beginning and 171.2MB in the end (delta: -86.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24720.37ms. Allocated memory was 230.7MB in the beginning and 333.4MB in the end (delta: 102.8MB). Free memory was 171.2MB in the beginning and 216.6MB in the end (delta: -45.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 175.41ms. Allocated memory is still 333.4MB. Free memory was 216.6MB in the beginning and 205.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 483 locations, 222 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10605 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10605 mSDsluCounter, 9056 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3837 mSDsCounter, 643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20387 IncrementalHoareTripleChecker+Invalid, 21030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 643 mSolverCounterUnsat, 5219 mSDtfsCounter, 20387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2786 GetRequests, 2656 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=7, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 5970 NumberOfCodeBlocks, 5594 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 6760 ConstructedInterpolants, 0 QuantifiedInterpolants, 15219 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2924 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 46 InterpolantComputations, 25 PerfectInterpolantSequences, 1214/1469 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 222 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((CCCELVOL3 == 7) && (i == 0)) && (2 <= CELLCOUNT)) && (CCCELVOL4 == 5)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((((CCCELVOL3 == 7) && (1 <= i)) && (2 <= CELLCOUNT)) && (CCCELVOL4 == 5)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 11:03:51,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE